Sciweavers

202 search results - page 7 / 41
» Performance-Driven Partitioning Using a Replication Graph Ap...
Sort
View
DM
2008
145views more  DM 2008»
13 years 7 months ago
Clique coverings and partitions of line graphs
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
Bo-Jr Li, Gerard J. Chang
ICNP
2000
IEEE
13 years 12 months ago
Optimal Partitioning of Multicast Receivers
Multicast sessions may have a large number of receivers with heterogeneous reception capacities. To accommodate this heterogeneity, various multi-rate schemes, based upon the use ...
Yang Richard Yang, Min Sik Kim, Simon S. Lam
IPPS
2007
IEEE
14 years 1 months ago
Availability/Consistency Balancing Replication Model
Replication combined with explicit management of data integrity constraints can be used to enhance availability of object-oriented, data-centric distributed systems when node and ...
Johannes Osrael, Lorenz Froihofer, Karl M. Gö...
MOBICOM
2006
ACM
14 years 1 months ago
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
ESCIENCE
2007
IEEE
14 years 1 months ago
A Dynamic Critical Path Algorithm for Scheduling Scientific Workflow Applications on Global Grids
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...
Mustafizur Rahman 0003, Srikumar Venugopal, Rajkum...