Sciweavers

5149 search results - page 689 / 1030
» Timed Asynchronous Distributed Systems
Sort
View
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
16 years 5 months ago
Parallel Algorithms for Computing Temporal Aggregates
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has outpaced advan...
Jose Alvin G. Gendrano, Bruce C. Huang, Jim M. Rod...
ICCD
2008
IEEE
167views Hardware» more  ICCD 2008»
15 years 11 months ago
Exploiting spare resources of in-order SMT processors executing hard real-time threads
— We developed an SMT processor that allows a static WCET analysis of several hard real-time threads and uses the remaining resources for soft or non real-time threads. The analy...
Jörg Mische, Sascha Uhrig, Florian Kluge, The...
MSWIM
2006
ACM
15 years 10 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
APCSAC
2005
IEEE
15 years 10 months ago
Irregular Redistribution Scheduling by Partitioning Messages
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
Chang Yu, Ching-Hsien Hsu, Kun-Ming Yu, Chiu-Kuo L...
INFOCOM
2005
IEEE
15 years 10 months ago
On failure detection algorithms in overlay networks
— One of the key reasons overlay networks are seen as an excellent platform for large scale distributed systems is their resilience in the presence of node failures. This resilie...
Shelley Zhuang, Dennis Geels, Ion Stoica, Randy H....