Name
Abstract | ||
|---|---|---|
Intervals are a new model for parallel programming based on an explicit happens before relation. Intervals permit fine-grained but high-level control of the program scheduler, and they dynamically detect and prevent deadlocking schedules. In this paper, we discuss the design decisions that led to the intervals model, focusing on error detection and handling. Our error propagation scheme makes use of the happens before relation to detect and abort dependent tasks that occur between the point where a failure occurs and where the failure is handled. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/IPDPSW.2010.5470943 | Parallel & Distributed Processing, Workshops and Phd Forum |
Keywords | Field | DocType |
parallel programming,scheduling,error detection,error propagation scheme,parallel programming,program scheduler,exceptions,intervals,parallelism | Abort,Propagation of uncertainty,Scheduling (computing),Computer science,Deadlock,Parallel processing,Error detection and correction,Schedule,Dynamic priority scheduling,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-4244-6533-0 | 1 | 0.37 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicholas D. Matsakis | 1 | 94 | 6.88 |
| Thomas R. Gross | 2 | 2807 | 404.74 |