Sciweavers

266 search results - page 29 / 54
» Distributed Routing in Tree Networks with Few Landmarks
Sort
View
NDSS
1999
IEEE
13 years 11 months ago
PGRIP: PNNI Global Routing Infrastructure Protection
We describe a system for achieving PNNI (Private Network-Network Interface) Global Routing Infrastructure Protection (PGRIP). We give details of PGRIP's system-level design a...
Sabrina De Capitani di Vimercati, Patrick Lincoln,...
TPDS
2008
175views more  TPDS 2008»
13 years 7 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
BROADCOM
2008
IEEE
14 years 2 months ago
UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance
Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These eve...
Herry Imanta Sitepu, Carmadi Machbub, Armein Z. R....
ICPP
1994
IEEE
13 years 11 months ago
A Distributed Cache Coherence Protocol for Hypercube Multiprocessors
- This paper proposes a distributed directory cache coherence protocol and compares the performance of the proposed protocol with fully mapped and single linked list protocols for ...
Yeimkuan Chang, Laxmi N. Bhuyan, Akhilesh Kumar
ICCAD
1993
IEEE
123views Hardware» more  ICCAD 1993»
13 years 11 months ago
Optimal sizing of high-speed clock networks based on distributed RC and lossy transmission line models
We have proposed an e cient measure to reduce the clock skew by assigning the clock network with variable branch widths. This measure has long been used for \H" clock tree. T...
Qing Zhu, Wayne Wei-Ming Dai, Joe G. Xi