Sciweavers

187 search results - page 23 / 38
» Distributed Constraints for Large-Scale Scheduling Problems
Sort
View
DEBS
2008
ACM
13 years 8 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
CLUSTER
2006
IEEE
14 years 1 months ago
Robust task scheduling in non-deterministic heterogeneous computing systems
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...
Zhiao Shi, Emmanuel Jeannot, Jack Dongarra
DEBS
2011
ACM
12 years 11 months ago
Declarative data-driven coordination
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
Johannes Gehrke
ICDCS
2002
IEEE
14 years 17 days ago
Scheduling Real-Time Data Items In Multiple Channels And Multiple Receivers Environments
In the real-time environments, information is disseminated to clients with timing constraint. In this paper, we focus on the real time data scheduling problem in multiple broadcas...
Guanling Lee, Yi-Ning Pan, Arbee L. P. Chen
SPAA
1999
ACM
13 years 12 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...