Sciweavers

59 search results - page 2 / 12
» Message Strip-Mining Heuristics for High Speed Networks
Sort
View
FASE
2010
Springer
13 years 11 months ago
Evaluating Ordering Heuristics for Dynamic Partial-Order Reduction Techniques
Actor programs consist of a number of concurrent objects called actors, which communicate by exchanging messages. Nondeterminism in actors results from the different possible orde...
Steven Lauterburg, Rajesh K. Karmani, Darko Marino...
JCC
2007
121views more  JCC 2007»
13 years 4 months ago
Speeding up parallel GROMACS on high-latency networks
: We investigate the parallel scaling of the GROMACS molecular dynamics code on Ethernet Beowulf clusters and what prerequisites are necessary for decent scaling even on such clust...
Carsten Kutzner, David van der Spoel, Martin Fechn...
IAJIT
2007
146views more  IAJIT 2007»
13 years 4 months ago
Adaptive Optimizing of Hello Messages in Wireless Ad-Hoc Networks
: Routing is an important functional aspect in wireless ad-hoc networks that handles discovering and maintaining the paths between nodes within a network. Due to nodes mobility, th...
Essam Natsheh, Adznan B. Jantan, Sabira Khatun, Su...
NDSS
1998
IEEE
13 years 9 months ago
Efficient Protocols for Signing Routing Messages
In this work, we aim to reduce the computational costs of using public-key digital signatures in securing routing protocols. Two protocols (COSP and IOSP) using one-time digitalsi...
Kan Zhang
CLUSTER
2004
IEEE
13 years 8 months ago
Improved message logging versus improved coordinated checkpointing for fault tolerant MPI
Fault tolerance is a very important concern for critical high performance applications using the MPI library. Several protocols provide automatic and transparent fault detection a...
Pierre Lemarinier, Aurelien Bouteiller, Thomas H&e...