Sciweavers

478 search results - page 35 / 96
» Diameter and Center Computations in Networks
Sort
View
PODC
2009
ACM
16 years 10 days ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
NSDI
2007
15 years 2 months ago
Black-box and Gray-box Strategies for Virtual Machine Migration
Virtualization can provide significant benefits in data centers by enabling virtual machine migration to eliminate hotspots. We present Sandpiper, a system that automates the ta...
Timothy Wood, Prashant J. Shenoy, Arun Venkatarama...
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 12 months ago
Mosaic: Policy Homomorphic Network Extension
With the advent of large-scale cloud computing infrastructures, network extension has emerged as a major challenge in the management of modern enterprise networks. Many enterprise...
L. Erran Li, Michael F. Nowlan, Y. R. Yang
ICALP
2009
Springer
16 years 2 days ago
A Distributed and Oblivious Heap
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
Christian Scheideler, Stefan Schmid
HPCA
2009
IEEE
16 years 10 days ago
A low-radix and low-diameter 3D interconnection network design
Interconnection plays an important role in performance and power of CMP designs using deep sub-micron technology. The network-on-chip (NoCs) has been proposed as a scalable and hi...
Bo Zhao, Jun Yang 0002, Xiuyi Zhou, Yi Xu, Youtao ...