380 search results - page 48 / 76 » Scheduling Distributed Real-Time Tasks in the DGMF Model |
135
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
133
click to vote
EUROPAR
2005
Springer
15 years 7 months ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
102
click to vote
HICSS
2000
IEEE
15 years 6 months ago
2000
IEEE
Multi-site scheduling deals with the scheduling problems of an enterprise with several distributed production sites, where sites are using the intermediate products of other sites...
121
click to vote
CLOUDCOM
2009
Springer
15 years 5 months ago
2009
Springer
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
132
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
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 ...