article · 2007

Processor Allocation Based on Weighted Bipartite Matching Scheduling

Jurij Silc, Borut Robic

Cited by 0Abstract and details only

Abstract

Many processor allocation methods for two-dimensional mesh connected parallel computers have been proposed in the literature. Generally, allocation methods can be divided into two categories, first-fit and best-fit. Assume that a mesh can be dynamically partitioned into several submeshes each of which can be concurrently allocated to one of the incoming independent programs and, after completion of that program, reclaimed by the system for future use. A first-fit allocation methods allocates the incoming programs to the first free submesh it detects. A best-fit methods identifies several candidate submeshes, and the program is allocated to the best-fit candidate based on certain heuristic. In this paper, we describe and evaluate a new best-fit processor allocation method called Weighted Bipartite Matching Allocation (WBMA) that, combined with a static optimizing mapping, reduces mesh system fragmentation and improves system&apos;s throughput.

Cite this paper

APA 7

Silc, J., & Robic, B. (2007). Processor Allocation Based on Weighted Bipartite Matching Scheduling.

MLA 9

Silc, Jurij, and Borut Robic. “Processor Allocation Based on Weighted Bipartite Matching Scheduling.” 2007.

Chicago

Silc, Jurij, and Borut Robic. 2007. “Processor Allocation Based on Weighted Bipartite Matching Scheduling.”

Harvard

Silc, J. and Robic, B. (2007) ‘Processor Allocation Based on Weighted Bipartite Matching Scheduling’.

BibTeX

@article{silc2007processor,
  title = {{Processor Allocation Based on Weighted Bipartite Matching Scheduling}},
  author = {Silc, Jurij and Robic, Borut},
  year = {2007}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.