A fast and efficient processor allocation scheme for mesh-connected multicomputers

Byung S. Yoo, Chitaranjan Das

Research output: Contribution to journalArticle

72 Scopus citations

Abstract

Efficient processor allocation is crucial for obtaining high performance in space-shared parallel computers. A good processor allocation algorithm should find available processors for incoming jobs, if they exist, with minimum overhead. In this paper, we propose such a fast and efficient processor allocation scheme for mesh-connected multicomputers. By using simple coordinate calculation and spatial subtraction, the proposed scheme reduces the search space drastically and, hence, can locate a free submesh very quickly. The algorithm is implemented efficiently using a stack and therefore is called the stack-based allocation (SBA) algorithm. Extensive simulation reveals that our scheme incurs much less allocation overhead than all of the existing allocation algorithms, while delivering competitive performance.

Original languageEnglish (US)
Pages (from-to)46-60
Number of pages15
JournalIEEE Transactions on Computers
Volume51
Issue number1
DOIs
StatePublished - Jan 1 2002

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'A fast and efficient processor allocation scheme for mesh-connected multicomputers'. Together they form a unique fingerprint.

  • Cite this