Sciweavers

272 search results - page 37 / 55
» On Efficient Models for Model Checking Message-Passing Distr...
Sort
View
WD
2010
15 years 27 days ago
Self-organized aggregation in irregular wireless networks
Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor kno...
Joanna Geibig, Dirk Bradler
CAL
2010
14 years 11 months ago
SMT-Directory: Efficient Load-Load Ordering for SMT
Memory models like SC, TSO, and PC enforce load-load ordering, requiring that loads from any single thread appear to occur in program order to all other threads. Out-of-order execu...
A. Hilton, A. Roth
IPPS
2006
IEEE
15 years 9 months ago
Ant-inspired query routing performance in dynamic peer-to-peer networks
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on qu...
Mojca Ciglaric, Tone Vidmar
JAVA
2001
Springer
15 years 7 months ago
Runtime optimizations for a Java DSM implementation
Jackal is a fine-grained distributed shared memory implementation of the Java programming language. Jackal implements Java’s memory model and allows multithreaded Java programs...
Ronald Veldema, Rutger F. H. Hofman, Raoul Bhoedja...
HPDC
1998
IEEE
15 years 7 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon