Skip to main content
eScholarship
Open Access Publications from the University of California

Deadlock-free scheduling of X10 computations with bounded resources

  • Author(s): Agarwal, S
  • Barik, R
  • Bonachea, D
  • Sarkar, V
  • Shyamasundar, RK
  • Yelick, K
  • Editor(s): Gibbons, Phillip B
  • Scheideler, Christian
  • et al.
Abstract

In this paper,we address the problem of guaranteeing the absence of physical deadlock in the execution of a parallel program using the async, finish, atomic, and place constructs from the X10 language. First, we extend previous work-stealing memory bound results for fully strict multi-threaded computations to terminally strict multithreaded computations in which one activity may wait for completion of a descendant activity (as in X10's async and finish constructs), not just an immediate child (as in Cilk 's spawn and sync constructs). This result establishes physical dead-lock freedom for SMP deployments.Second,we introduce a new class of X10 deployments for clusters, which builds on an underlying Active Message network and the new concept of Doppelgänger mode execution of X10 activities. Third, we use this new class of deployments to establish physical deadlock freedom for deployments on clusters of uniprocessors. Together these results give the user the ability to execute a rich set of programs written with async finish atomic and place constructs without worrying about the possibility of physical deadlock due to computation, memory and communication resources. A major open topic for future work is to extend these results to deployments on clusters of SMPs. Copyright 2007 ACM.

Main Content
Current View