Sciweavers

402 search results - page 41 / 81
» Gang EDF Scheduling of Parallel Task Systems
Sort
View
207
Voted
IPPS
1998
IEEE
15 years 11 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
IPPS
2003
IEEE
16 years 21 days ago
Dynamic Mapping in a Heterogeneous Environment with Tasks Having Priorities and Multiple Deadlines
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
Jong-Kook Kim, Sameer Shivle, Howard Jay Siegel, A...
182
Voted
SIGMOD
1996
ACM
133views Database» more  SIGMOD 1996»
15 years 11 months ago
Multi-dimensional Resource Scheduling for Parallel Queries
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
Minos N. Garofalakis, Yannis E. Ioannidis
PPAM
2007
Springer
16 years 1 months ago
A Formal Model of Multi-agent Computations
Abstract. The paper contains an extension of a formal model of multiagent computing system developed in previous publications towards considering a more general system state. We pr...
Maciej Smolka
SPAA
2009
ACM
16 years 8 months ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...