Minimizing Fragmentation in Contiguous Submesh Allocation Scheme 


Vol. 12,  No. 2, pp. 117-126, Apr.  2005
10.3745/KIPSTA.2005.12.2.117


PDF
  Abstract

This paper presents an adaptive processor allocation strategy to reduce fragmentation in a large multi-user multicomputer system. A small number of jobs with unexpectedly large submesh allocation requirements may significantly increase the queuing delay of the rest of jobs. Under such circumstances, our strategy futher tries to allocate L-shaped submeshes instead of signaling the allocation failure unlike other strategies. We have developed the efficient algorithm to find the allocatable L-shaped submeshes. Thus, our strategy reduces the mean response time by minimizing the queuing delay, even though jobs are scheduled in an FCFS to preserve fairness. The simulations show that our strategy performs more efficiently than other strategies in terms of the job response time and the system utilization.

  Statistics
  Cite this article

[IEEE Style]

K. H. Seo and S. C. Kim, "Minimizing Fragmentation in Contiguous Submesh Allocation Scheme," The KIPS Transactions:PartA, vol. 12, no. 2, pp. 117-126, 2005. DOI: 10.3745/KIPSTA.2005.12.2.117.

[ACM Style]

Kyung Hee Seo and Sung Chun Kim. 2005. Minimizing Fragmentation in Contiguous Submesh Allocation Scheme. The KIPS Transactions:PartA, 12, 2, (2005), 117-126. DOI: 10.3745/KIPSTA.2005.12.2.117.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals