Cyclic allocation of two-dimensional data

S. Prabhakar, K. Abdel-Ghaffar, D. Agrawal, A. El Abbadi

Research output: Contribution to conferencePaper

Abstract

Various proposals have been made for declustering two-dimensionally tiled data on multiple I/O devices. Recently it has been shown that strictly optimal solutions only exist under very restrictive conditions on the tiling of the two-dimensional space or for very few I/O devices. In this paper we explore allocation methods where no strictly optimal solution exists. We propose a general class of allocation methods, referred to as cyclic allocation methods, and show that many existing methods are instances of this class. As a result, various seemingly ad hoc and unrelated methods are presented in a single framework. Furthermore, the framework is used to develop new allocation methods that give better performance than any previous method and that approach the best feasible performance.

Original languageEnglish
Pages94-101
Number of pages8
Publication statusPublished - 1 Jan 1998
EventProceedings of the 1998 14th International Conference on Data Engineering - Orlando, FL, USA
Duration: 23 Feb 199827 Feb 1998

Other

OtherProceedings of the 1998 14th International Conference on Data Engineering
CityOrlando, FL, USA
Period23/2/9827/2/98

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Cite this

Prabhakar, S., Abdel-Ghaffar, K., Agrawal, D., & El Abbadi, A. (1998). Cyclic allocation of two-dimensional data. 94-101. Paper presented at Proceedings of the 1998 14th International Conference on Data Engineering, Orlando, FL, USA, .