Sciweavers

11348 search results - page 1955 / 2270
» On time-scale designs for networks
Sort
View
HPCA
2003
IEEE
16 years 7 months ago
Evaluating the Impact of Communication Architecture on the Performability of Cluster-Based Services
We consider the impact of different communication architectures on the performability (performance + availability) of cluster-based servers. In particular, we use a combination of ...
Kiran Nagaraja, Neeraj Krishnan, Ricardo Bianchini...
HPCA
2001
IEEE
16 years 7 months ago
Dynamic Branch Prediction with Perceptrons
This paper presents a new method for branch prediction. The key idea is to use one of the simplest possible neural networks, the perceptron as an alternative to the commonly used ...
Daniel A. Jiménez, Calvin Lin
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 7 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 7 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
OSDI
2002
ACM
16 years 7 months ago
Taming Aggressive Replication in the Pangaea Wide-Area File System
Pangaea is a wide-area file system that supports data sharing among a community of widely distributed users. It is built on a symmetrically decentralized infrastructure that consi...
Yasushi Saito, Christos T. Karamanolis, Magnus Kar...
« Prev « First page 1955 / 2270 Last » Next »