842 search results - page 135 / 169 » Distributed Innovation in Classes of Networks |
SIGCOMM
2000
ACM
14 years 1 months ago
2000
ACM
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and th...
PPOPP
1999
ACM
14 years 1 months ago
1999
ACM
Writing parallel applications for computational grids is a challenging task. To achieve good performance, algorithms designed for local area networks must be adapted to the differ...
HPCN
2000
Springer
14 years 25 days ago
2000
Springer
Data futures in a metacomputing system refer to data products that have not yet been created but which can be uniquely named and manipulated. We employ data flow mechanisms expres...
JSSPP
1995
Springer
14 years 23 days ago
1995
Springer
In this paper, we describe a new job scheduling class, called \Time Space Sharing Scheduling" (TSSS) for dynamically partitionable parallel machines. As an instance of TSSS, ...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...