Abstract
In this article, we simulate and evaluate various Two-level Scheduling algorithms for cluster-based NUMA (Non-Uniform Memory Access) multiprocessors. Two-level 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-process-first Method are superior for Cluster-free Algorithm. © 1998 Scripta Technica. Syst Comp Jpn, 29(2): 36–46, 1998
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
