By Topic

Request queueing for magnetic bubble memories

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bonyhard, P.I. ; Bell Laboratories, Murray Hill, N.J. ; Hagedorn, F.

The improvements in request throughput that result from the use of the shortest seek time first (SSTF) request, scheduling algorithm for major/minor loop organized magnetic bubble memories are considered. For the satisfaction of read requests the bubble memory can be considered as equivalent to a file drum with fixed block size. Bubble memories are considered with 64 kbits per chip running at a 5.6 μs stepping rate and serving 750 to 830 read requests pet second (as opposed to ≤ 419 requests per second without queueing) with both uniform and Poisson arrival rates. A priority interrupt algorithm is implemented that assures that all requests are served in ≤ 60ms, while average service times are 10 to 20 ms. Results of simulation runs, corresponding to the various cases of interest, are presented. It is concluded that request queueing with the appropriate scheduling algorithm is a practical way of improving bubble memory performance.

Published in:

Magnetics, IEEE Transactions on  (Volume:14 ,  Issue: 2 )