Personal tools
You are here: Home Publications Performance Estimation for Scheduling on Shared Networks
Document Actions

Shreenivasa Venkataramaiah and Jaspal Subhlok (2003)

Performance Estimation for Scheduling on Shared Networks

In: 9th International Workshop Job Scheduling Strategies for Parallel Processing (JSSPP 2003), ed. by Dror Feitelson, Larry Rudolph, Uwe Schwiegelshohn, pp. 148 - 165, Springer-Verlag Heidelberg.

This paper develops a framework to model the performance of parallel applications executing in a shared network computing environment. For sharing of a single computation node or network link, the actual performance is predicted, while for sharing of multiple nodes and links, performance bounds are developed. The methodology for building such a shared execution performance model is based on monitoring an applications execution behavior and resource usage under controlled dedicated execution. The procedure does not require access to the source code and hence can be applied across programming languages and models. We validate our approach with experimental results with NAS benchmarks executed in different resource sharing scenarios on a small cluster. Applicability to more general scenarios, such as large clusters, memory and I/O bound programs and wide are networks, remain open questions that are included in the discussion. This paper makes the case that understanding and modeling application behavior is important for resource allocation and offers a promising approach to put that in practice.

by admin last modified 2007-12-10 21:05
« September 2010 »
Su Mo Tu We Th Fr Sa
1234
567891011
12131415161718
19202122232425
2627282930
 

Powered by Plone

LACSI Collaborators include:

Rice University LANL UH UNM UIUC UNC UTK