280 search results - page 29 / 56 » Quasi-Static Scheduling of Communicating Tasks |
HPCC
2009
Springer
14 years 8 days ago
2009
Springer
This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...
JSA
2000
13 years 7 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
SIGMETRICS
1998
ACM
13 years 12 months ago
1998
ACM
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—We consider the problem of neighbor discovery in wireless networks with nodes operating in multiple frequency bands and with asymmetric beacon intervals. This is a challenging t...