๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Performance evaluation of Two-level Scheduling algorithms for NUMA multiprocessors

โœ Scribed by Yukio Ohishi; Keizo Saisho; Akira Fukuda

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
210 KB
Volume
29
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this article, we simulate and evaluate various Twolevel Scheduling algorithms for cluster-based NUMA (Non-Uniform Memory Access) multiprocessors. Twolevel Scheduling is a kind of space partitioning scheduling. We evaluate the following variations: (1) Cluster-free Algorithm and (2) Cluster-limited Algorithm for processor group configuration, (a) Idle-processor-keep Method and (b) Idle-processor-release Method for idle processor processing, and (a) Running-process-first Method and (b) Waiting-process-first Method for free processor assignment. The result shows: (1) Cluster-limited Algorithm is superior to Cluster-free Algorithm in general, 2) Cluster-limited Algorithm is not influenced so much by various alternatives, (3) Idle-processor-keep Method and Waiting-processfirst Method are superior for Cluster-free Algorithm.

๐Ÿ“œ SIMILAR VOLUMES

The impact of approximate evaluation on
The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
โœ Watson, J. P. (author);Rana, S. (author);Whitley, L. D. (author);Howe, A. E. (au ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 254 KB ๐Ÿ‘ 2 views

The Coors warehouse scheduling problem involves finding a permutation of customer orders that minimizes the average time that customers' orders spend at the loading docks while at the same time minimizing the running average inventory, Search-based solutions require fast objective functions. Thus, a