Adaptive time/space sharing with SCOJO
by Angela C. Sodan, Xuemin Huang
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 4, No. 5/6, 2006

Abstract: Time-shared execution of parallel jobs via gang scheduling is known to yield better average response times than space sharing. We incorporate adaptive CPU/node-resource allocation to consider varying system load and to reduce fragmentation. As main innovations, our SCOJO approach provides a clear model how to adapt, and considers realistic job mixes with moldable, malleable and rigid jobs. Our adaptive SCOJO significantly decreases response times and average slowdowns, while using a lower multiprogramming level than standard gang scheduling uses best and, therefore, decreasing the memory pressure. These benefits apply though the realistic job mixes limit the flexibility in resource allocation.

Online publication date: Tue, 01-May-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email