Download:
by Fangzhe Chang, Vijay Karamcheti, Zvi Kedem
In Proc. 13th Intl. Parallel Processing Symposium
http://www.zmkedem.com/nyu/pubs/CKK1998a.pdf
Add To MetaCart
Abstract:
Parallel computing is becoming increasing central and mainstream, driven both by the widespread availability of commodity SMP and high-performance cluster platforms, as well as the growing use of parallelism in general-purpose applications such as image recognition, virtual reality, and media processing. In addition to performance requirements, the latter computations impose soft real-time constraints, necessitating efficient, predictable parallel resource management. Unfortunately, traditional resource management approaches in both parallel and real-time systems are inadequate for meeting this objective; the parallel approaches focus primarily on improving application performance and/or system utilization at the cost of arbitrarily delaying a given application, while the real-time approaches are overly conservative sacrificing system utilization in order to meet application deadlines. In this paper, we propose a novel approach for increasing parallel system utilization while meeting application soft real-time deadlines. Our approach exploits the application tunability found in several general-purpose computations. Tunability refers to an application’s ability to trade off resource requirements over time, while maintaining a desired level of output quality. In other words, a large allocation of resources in one stage of the computation’s lifetime may compensate, in a parameterizable manner, for a smaller allocation in another stage. We first describe language extensions to support tunability in the Calypso programming system, a component of the MILAN metacomputing project, and evaluate their expressiveness using an image processing application. We then characterize the performance benefits of tunability, using a synthetic task system to systematically identify its benefits and shortcomings. Our results are very encouraging: application tunability is convenient to express, and can significantly improve parallel system utilization for computations with predictability requirements. 1
Citations
|
2248
|
Layland: Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment
– Liu, W
|
|
994
|
A Bridging Model for Parallel Computation
– Valiant
- 1990
|
|
776
|
Using MPI: Portable Parallel Programming with the Message Passing Interface
– Gropp, Lusk, et al.
- 1994
|
|
115
|
How multimedia workloads will change processor design
– Diefendorff, Dubey
- 1997
|
|
110
|
Charlotte: Metacomputing on the web
– Baratloo, Karaul, et al.
- 1996
|
|
92
|
Scheduling from the perspective of the application
– Berman, Wolski
- 1996
|
|
76
|
Efficient robust parallel computations
– Kedem, Palem, et al.
- 1990
|
|
66
|
Segmentation by grouping junctions
– Ishikawa, Geiger
- 1998
|
|
59
|
Calypso: A Novel Software System for Fault-Tolerant Parallel Processing on Distributed Platforms
– Baratloo, Dasgupta, et al.
- 1995
|
|
55
|
Network-based concurrent computing on the PVM system
– Geist, Sunderam
- 1992
|
|
49
|
Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach
– Dasgupta, Kedem, et al.
- 1995
|
|
47
|
An End-toEnd QoS Model and Management Architecture
– Hull, Shankar, et al.
- 1997
|
|
44
|
Performance of Real-Time Bus Scheduling Algorithms
– Lehoczky, Sha
- 1986
|
|
34
|
Scheduling tasks with and/or precedence constraints
– Gillies, Liu
- 1995
|
|
31
|
Application Level Scheduling of Gene Sequence Comparison on
– Spring, Wolski
- 1998
|
|
30
|
Customizable Resource Management for Value-added Network Services
– Chandra
- 1998
|
|
25
|
A wavelet approach to foveating images
– Chang, Yap
- 1997
|
|
24
|
Exposing application alternatives
– Keleher, Hollingsworth, et al.
- 1999
|
|
19
|
Realtime visualization of large images over a thinwire
– Chang, Yap, et al.
- 1997
|
|
14
|
Dynamic Resource Management on Distributed Systems Using Reconfigurable Applications
– Moreira, Naik
- 1997
|
|
12
|
Chime: A Versatile Distributed Parallel Processing Environment
– Sardesai, Dasgupta
- 1997
|
|
11
|
Metacomputing with MILAN
– Baratloo, Dasgupta, et al.
- 1999
|
|
5
|
Mechanism for just-in-time allocation of resources to adaptive parallel programs
– Baratloo, Itzkovitz, et al.
- 1999
|
|
5
|
Dynamic application structuring on heterogeneous, distributed systems
– Chatterjee
- 1999
|
|
5
|
et al. Parallel computing on the Berkeley NOW
– Culler
- 1997
|
|
4
|
A Description of CC
– Chandy, Kesselman
- 1992
|
|
3
|
Scheduling alorithms for multiprogramming in a hard-real-time environment
– Liu, Layland
- 1973
|
|
1
|
Scheduling tasks with and or precedence constraints
– Gillies, Liu
- 1995
|
|
1
|
EPIQ Qos characterization
– Liu, Nahrstedt, et al.
- 1997
|