Sciweavers

783 search results - page 124 / 157
» Routing in Overlay Multicast Networks
Sort
View
FGCS
2010
76views more  FGCS 2010»
13 years 6 months ago
Self-healing network for scalable fault-tolerant runtime environments
Scalable and fault tolerant runtime environments are needed to support and adapt to the underlying libraries and hardware which require a high degree of scalability in dynamic larg...
Thara Angskun, Graham E. Fagg, George Bosilca, Jel...
ICPADS
2008
IEEE
14 years 2 months ago
Quarc: A Novel Network-On-Chip Architecture
This paper introduces the Quarc NoC, a novel NoC architecture inspired by the Spidergon NoC [16]. The Quarc scheme significantly outperforms the Spidergon NoC through balancing t...
Mahmoud Moadeli, Wim Vanderbauwhede, Ali Shahrabi
ATAL
2007
Springer
14 years 1 months ago
Information searching and sharing in large-scale dynamic networks
Finding the right agents in a large and dynamic network to provide the needed resources in a timely fashion, is a long standing problem. This paper presents a method for informati...
George A. Vouros
CISS
2008
IEEE
14 years 2 months ago
Peer-to-Peer utility maximization
—In this paper, we study the problem of utility maximization in Peer-to-Peer (P2P) systems, in which aggregate utilities are maximized by running distributed algorithms on P2P no...
Minghua Chen, Sudipta Sengupta, Miroslav Ponec, Ph...
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
14 years 1 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia