Sciweavers

13 search results - page 3 / 3
» Dual of a Complete Graph as an Interconnection Network
Sort
View
CORR
2011
Springer
212views Education» more  CORR 2011»
12 years 11 months ago
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
Haris Aziz, Troels Bjerre Sørensen
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 5 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
JSAC
2007
97views more  JSAC 2007»
13 years 5 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li