By Topic

A strictly-optimal strategy to access multi-dimensional data on parallel disk systems

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)
Das, S.K. ; Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA ; Pinotti, M.C.

The disk allocation problem addresses the issue of how to distribute large files among several disks so as to maximize the concurrent disk accesses in response to partial match queries. In the past, this problem has been studied for binary as well as for p-ary cartesian product files. We propose a strictly-optimal disk allocation strategy for non-uniform cartesian product files for every partial match query. Our strategy is based on a large and flexible class of maximum distance separable (MDS) codes, namely the redundant residue codes. A new family of residue codes, called the redundant non-pairwise prime residue codes, is also introduced

Published in:

Parallel Processing, 1999. Proceedings. 1999 International Conference on

Date of Conference: