Sciweavers

138 search results - page 23 / 28
» Tree-based overlay networks for scalable applications
Sort
View
IPTPS
2004
Springer
14 years 1 months ago
Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet
— Peer-to-peer computing, the harnessing of idle compute cycles throughout the Internet, offers exciting new research challenges in the converging domains of networking and distr...
Virginia Mary Lo, Daniel Zappala, Dayi Zhou, Yuhon...
SRDS
2005
IEEE
14 years 1 months ago
Distributed Construction of a Fault-Tolerant Network from a Tree
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
Michael K. Reiter, Asad Samar, Chenxi Wang
ICUMT
2009
13 years 5 months ago
Two-layer network coordinate system for Internet distance prediction
Network coordinate (NC) system is an efficient and scalable system for Internet distance prediction. In this paper, we propose 3 two-layer NC systems HNPS, HBBS and HIDES derived f...
Chengbo Dong, Guodong Wang, Xuan Zhang, Beixing De...
PAM
2004
Springer
14 years 1 months ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella
IPPS
2003
IEEE
14 years 29 days ago
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...