Skip Navigation

The Computer Journal 1988 31(6):565-566; doi:10.1093/comjnl/31.6.565
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chang, C. C.
Right arrow Articles by Chen, C. Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short notes

A Recursive Performance Formula of the Disc Modulo Allocation Method for Binary Cartesian Product Files

C. C. Chang1 * and C. Y. Chen2 §

1 The Institute of Applied Mathematics, National Chung Hsing University, Taichung, Taiwan 40277, Republic of China, 2 Department of Electronics, Feng Chia University, Taichung, Taiwan 40724, Republic of China

In this paper an efficient recursive formula for evaluating the performance of the Disc Modulo method of allocating binary Cartesian product files to multi-disc systems is presented. It significantly improves the recently derived performance formula by the authors.

Received June 1987. revised March 1988.

* The Institute of Applied Mathematics, National Chung Hsing University, Taichung, Taiwan 40277, Republic of China.

§ Department of Electronics, Feng Chia University, Taichung, Taiwan 40724, Republic of China.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.