Efficient user-level thread migration and checkpointing on windows NT clusters

  • Authors:
  • Hazim Abdel-Shafi;Evan Speight;John K. Bennett

  • Affiliations:
  • Department of Electrical and Computer Engineering, Rice University, Houston, Texas;Department of Electrical and Computer Engineering, Rice University, Houston, Texas;Department of Electrical and Computer Engineering, Rice University, Houston, Texas

  • Venue:
  • WINSYM'99 Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

Abstract

Clusters of industry-standard multiprocessors are emerging as a competitive alternative for large-scale parallel computing. However, these systems have several disadvantages over large-scale multiprocessors, including complex thread scheduling and increased susceptibility to failure. This paper describes the design and implementation of two user-level mechanisms in the Brazos parallel programming environment that address these issues on clusters of multiprocessors running Windows NT: thread migration and checkpointing. These mechanisms offer several benefits: (1) The ability to tolerate the failure of multiple computing nodes with minimal runtime overhead and short recovery time. (2) The ability to add and remove computing nodes while applications continue to run, simplifying scheduled maintenance operations and facilitating load balancing. (3) The ability to tolerate power failures by performing a checkpoint before shutdown or by migrating computation threads to other stable nodes. Brazos is a distributed system that supports both shared memory and message passing parallel programming paradigms on networks of Intel x86-based multiprocessors running Windows NT. The performance of thread migration in Brazos is an order of magnitude faster than previously reported Windows NT implementations, and is competitive with implementations on other operating systems. The checkpoint facility exhibits low runtime overhead and fast recovery time.