Processor Allocation and Checkpoint Interval Selection in Cluster Computing Systems |
| |
| Affiliation: | 1. Department of Computer Science and Engineering, Pohang University of Science and Technology (POSTECH), 77 Cheongam-Ro, Nam-Gu, Pohang, Gyeongbuk, 790-784, Republic of Korea;2. Department of Computer Science, State University of New York at Albany, 1400 Washington Ave., Albany, NY 12222, USA;3. Theory Group, Microsoft Research Asia, Headquarters, Building 2, 14-171, 5 Dan Ling Street, Haidian District, Beijing, 100080, China;1. School of Computer Science and Engineering, Northwestern Polytechnical University, Xi’an, China;2. School of Astronautics, Northwestern Polytechnical University, Xi’an, China;3. The University of Adelaide, Australia |
| |
| Abstract: | Performance prediction of checkpointing systems in the presence of failures is a well-studied research area. While the literature abounds with performance models of checkpointing systems, none addresses the issue of selecting runtime parameters other than the optimal checkpointing interval. In particular, the issue of processor allocation is typically ignored. In this paper, we present a performance model for long-running parallel computations that execute with checkpointing enabled. We then discuss how it is relevant to today's parallel computing environments and software, and present case studies of using the model to select runtime parameters. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
