Dynamic Task Scheduling for 3D Torus Multicomputer Systems 


Vol. 8,  No. 3, pp. 245-252, Sep.  2001
10.3745/KIPSTA.2001.8.3.245


PDF
  Abstract

Multicomputer systems achieve high performance by utilizing a number of computing nodes. Multidimensional meshes have become popular as multicomputer architectures due to their simplicity and efficiency. In this paper we propose an efficient processor allocation scheme for 3D torus based on first-fit approach. The scheme minimizes the allocation time by effectively manipulating the 3D information as 2D information using CST (Coverage Status Table). Comprehensive computer simulation reveals that the allocation time of the proposed scheme is always smaller than the earlier scheme based on best-fit approach, while allowing comparable processor utilization. The difference gets more significant as the input load increases. To investigate the performance of the proposed scheme with different scheduling environment, non-FCFS scheduling policy along with the typical FCFS policy is also studied.

  Statistics
  Cite this article

[IEEE Style]

H. S. Choo, H. Y. Youn, G. L. Park, "Dynamic Task Scheduling for 3D Torus Multicomputer Systems," The KIPS Transactions:PartA, vol. 8, no. 3, pp. 245-252, 2001. DOI: 10.3745/KIPSTA.2001.8.3.245.

[ACM Style]

Hyun Seung Choo, Hee Yong Youn, and Gyung Leen Park. 2001. Dynamic Task Scheduling for 3D Torus Multicomputer Systems. The KIPS Transactions:PartA, 8, 3, (2001), 245-252. DOI: 10.3745/KIPSTA.2001.8.3.245.

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