Sciweavers

279 search results - page 18 / 56
» Low Overhead Parallel Schedules for Task Graphs
Sort
View
ISCC
2002
IEEE
131views Communications» more  ISCC 2002»
14 years 20 days ago
Scheduling real time parallel structure on cluster computing
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
Reda A. Ammar, Abdulrahman Alhamdan
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 1 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
CCGRID
2010
IEEE
13 years 8 months ago
Selective Recovery from Failures in a Task Parallel Programming Model
Abstract--We present a fault tolerant task pool execution environment that is capable of performing fine-grain selective restart using a lightweight, distributed task completion tr...
James Dinan, Arjun Singri, P. Sadayappan, Sriram K...
ICPP
2008
IEEE
14 years 2 months ago
Scioto: A Framework for Global-View Task Parallelism
We introduce Scioto, Shared Collections of Task Objects, a lightweight framework for providing task management on distributed memory machines under one-sided and globalview parall...
James Dinan, Sriram Krishnamoorthy, D. Brian Larki...
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
14 years 21 days ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek