Sciweavers

2924 search results - page 246 / 585
» Lower Bounds in Distributed Computing
Sort
View
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 11 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
CISIS
2008
IEEE
15 years 10 months ago
Hybrid Performance Modeling and Prediction of Large-Scale Computing Systems
Abstract—Performance is a key feature of large-scale computing systems. However, the achieved performance when a certain program is executed is significantly lower than the maxi...
Sabri Pllana, Siegfried Benkner, Fatos Xhafa, Leon...
FCCM
1997
IEEE
118views VLSI» more  FCCM 1997»
15 years 8 months ago
Computing kernels implemented with a wormhole RTR CCM
The Wormhole Run-Time Reconfiguration (RTR) computing paradigm is a method for creating high performance computational pipelines. The scalability, distributed control and data pow...
Ray Bittner, Peter M. Athanas
ALMOB
2006
80views more  ALMOB 2006»
15 years 4 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
INFORMATICALT
2007
97views more  INFORMATICALT 2007»
15 years 3 months ago
Fabric Level and Application Level QoS Guarantees in Grid Computing
In the paper, a cross-layer optimization between application layer and fabric layer is proposed. The aim is to optimize the end-to-end quality of the dynamic grid application as we...
Li Chunlin, Li Layuan