The Interaction of Parallel and Sequential Workloads on a Network of Workstations (1995)
Cached
Download Links
- [www.cs.berkeley.edu]
- [www.cs.berkeley.edu]
- [www.cs.berkeley.edu]
- [http.CS.Berkeley.EDU]
- [www.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 121 - 10 self |
BibTeX
@INPROCEEDINGS{Arpaci95theinteraction,
author = {Remzi H. Arpaci and Andrea C. Dusseau and Amin M. Vahdat and Lok T. Liu and Thomas E. Anderson and David A. Patterson},
title = {The Interaction of Parallel and Sequential Workloads on a Network of Workstations},
booktitle = {},
year = {1995},
pages = {267--278}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper examines the plausibility of using a network of workstations (NOW) for a mixture of parallel and sequential jobs. Through simulations, our study examines issues that arise when combining these two workloads on a single platform. Starting from a dedicated NOW just for parallel programs, we incrementally relax uniprogramming restrictions until we have a multi-programmed, multi-user NOW for both interactive sequential users and parallel programs. We show that a number of issues associated with the distributed NOW environment (e.g., daemon activity, coscheduling skew) can have a small but noticeable effect on parallel program performance. We also find that efficient migration to idle workstations is necessary to maintain acceptable parallel application performance. Furthermore, we present a methodology for deriving an optimal delay time for recruiting idle machines for use by parallel programs; this recruitment threshold was just 3 minutes for the research cluster we measured. ...
