Sciweavers

1380 search results - page 54 / 276
» scheduling 2008
Sort
View
INFOCOM
2008
IEEE
14 years 4 months ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...
CCGRID
2008
IEEE
13 years 12 months ago
A Decentralized and Cooperative Workflow Scheduling Algorithm
In the current approaches to workflow scheduling, there is no cooperation between the distributed workflow brokers and as a result, the problem of conflicting schedules occur. To o...
Rajiv Ranjan, Mustafizur Rahman 0003, Rajkumar Buy...
GRID
2008
Springer
13 years 11 months ago
Dynamic scheduling for heterogeneous Desktop Grids
Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the res...
Issam Al-Azzoni, Douglas G. Down
TC
2008
13 years 10 months ago
Deferrable Scheduling for Maintaining Real-Time Data Freshness: Algorithms, Analysis, and Results
The periodic update transaction model has been used to maintain the freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus of pa...
Ming Xiong, Song Han, Kam-yiu Lam, Deji Chen
EAAI
2008
104views more  EAAI 2008»
13 years 10 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret