Sciweavers

2080 search results - page 135 / 416
» Measuring empirical computational complexity
Sort
View
SPAA
2009
ACM
15 years 11 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
AMR
2008
Springer
288views Multimedia» more  AMR 2008»
15 years 6 months ago
Automatic Reduction of MIDI Files Preserving Relevant Musical Content
Retrieving music from large digital databases is a demanding computational task. The cost for indexing and searching depends not only on the computational effort of measuring music...
Søren Tjagvad Madsen, Rainer Typke, Gerhard...
IPPS
2006
IEEE
15 years 10 months ago
A framework to develop symbolic performance models of parallel applications
Performance and workload modeling has numerous uses at every stage of the high-end computing lifecycle: design, integration, procurement, installation and tuning. Despite the trem...
Sadaf R. Alam, Jeffrey S. Vetter
MOBICOM
2004
ACM
15 years 10 months ago
MobiDesk: mobile virtual desktop computing
We present MobiDesk, a mobile virtual desktop computing hosting infrastructure that leverages continued improvements in network speed, cost, and ubiquity to address the complexity...
Ricardo A. Baratto, Shaya Potter, Gong Su, Jason N...
TPDS
2008
113views more  TPDS 2008»
15 years 4 months ago
Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs
Computational Grids potentially offer low cost, readily available, and large-scale high-performance platforms. For the parallel execution of programs, however, computational GRIDs ...
Abdallah Al Zain, Philip W. Trinder, Greg Michaels...