Efficient processor management schemes for mesh-connected multicomputers

Yoo, Byung Soo; Das, Chita R.

doi:10.1016/s0167-8191(01)00078-3

Cited by 6 publications

(6 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Comparing with the execution time of the unfolded jobs, the folded jobs are obviously treated unfairly. The limit -^ k allocation [38] is an extension of the limit allocation to the mesh system. It searches for smaller submeshes when the required submesh is not present Ln the system.…”

Section: Other Allocation Approachesmentioning

confidence: 99%

“…A variety of scheduling schemes for the multicomputers have been reported in the literature [29]- [38] and [43]- [52]. Traditionally, scheduling in multicomputers is done via.…”

Section: Scheduling Approachesmentioning

confidence: 99%

“…The concept of multiprogramming has been implemented in the [38] and the TSS [37] strategies. Both policies require large memory space to store the information of multiprogrammed nodes and incur high time complexities.…”

Section: Multiprogramming In Multicomputersmentioning

confidence: 99%

“…Many processors can be left idle even when there are jobs waiting. By executing the jobs in a carefully arranged order, the blocking effect of the FCFS queue can be dinainished as proved in the schemes reported in [33,34,35,38,37]. However, these schemes require large storage space for implementation of the required multiple queues and are also complicated from an implementation standpoint.…”

Section: Bypass-queue (Bq) Schedulingmentioning

confidence: 99%

“…The blocking caused by fragmentation can there fore be reduced. Other researchers [37,38] have considered implementing the concept of multiprogramming used in the uniprocessor environment for the multicomputer systems.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Efficient processor management strategies for multicomputer systems

Chang

Mohapatra²

View full text Add to dashboard Cite

This manuscript has been reproduced from the microfihn master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer.The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely affect reproduction.In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand comer and continuing from left to right in equal sections with small overlaps. Each original is also photographed in one exposure and is included in reduced form at the back of the book.

show abstract

Section: Other Allocation Approachesmentioning

confidence: 99%

“…A variety of scheduling schemes for the multicomputers have been reported in the literature [29]- [38] and [43]- [52]. Traditionally, scheduling in multicomputers is done via.…”

Section: Scheduling Approachesmentioning

confidence: 99%

Section: Multiprogramming In Multicomputersmentioning

confidence: 99%

Section: Bypass-queue (Bq) Schedulingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations