Lookahead processor allocation in mesh-connected massively parallel multicomputer

Souray Bhattacharya, Wei Tek Tsai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Scopus citations

Abstract

This paper proposes the lookahead idea in job allocation in a mesh-connected parallel processor, which has become popular in the design of massively parallel computers. The allocation heuristic can select its strategy by lookahead, i.e., looking into the queue of waiting jobs. This approach is shown to be superior to the existing heuristics which do not utilize and lookahead. For efficient implementation, we propose a compact rectangular set representation of the free submesh area which allows the complete submesh detection (also allocation) algorithm(s) to be an order of magnitude improved (in the average case) over the existing approach(es). The proposed representation is also beneficial when considering some currently unexplored issues in processor allocation and practitioner's approach.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
PublisherPubl by IEEE
Pages868-875
Number of pages8
ISBN (Print)0818656026
StatePublished - Jan 1 1994
EventProceedings of the 8th International Parallel Processing Symposium - Cancun, Mex
Duration: Apr 26 1994Apr 29 1994

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Other

OtherProceedings of the 8th International Parallel Processing Symposium
CityCancun, Mex
Period4/26/944/29/94

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Bhattacharya, S., & Tsai, W. T. (1994). Lookahead processor allocation in mesh-connected massively parallel multicomputer. In Proceedings of the International Conference on Parallel Processing (pp. 868-875). (Proceedings of the International Conference on Parallel Processing). Publ by IEEE.