Cart (Loading....) | Create Account
Close category search window

Non-busy access system for bubble memory chips

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)
Yamada, H. ; NEC Corporation, Kawasaki, Japan ; Takahashi, K.

Non-busy access (NBA) bubble memory systems to improve request throughput by the use of a shortest access time first (SATF) request scheduling algorithm are considered for on-chip cache organized 4 Mb bubble memory chips. The NBA bubble memory system consists of multiple bubble memory units, each of which is realized by adding a marker RAM, an address switch and a data buffer to a conventional bubble memory unit for request queuing. Computer simulation results proved that the NBA bubble memory system can serve more than 900 requests a second, while the average response time is held to less than 16.5 ms. It is concluded that the NBA bubble memories for application to database index files can have several tens of times higher throughput performance than the conventional bubble or magnetic disk memories.

Published in:

Magnetics, IEEE Transactions on  (Volume:21 ,  Issue: 5 )

Date of Publication:

Sep 1985

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.