Sciweavers

1497 search results - page 30 / 300
» A Computational Model for Message Passing
Sort
View
PERCOM
2003
ACM
14 years 8 months ago
Mobile Link Services with MQSeries Everyplace
The Open Hypermedia model is based upon the separation of hypertext links from documents and treats them as separate entities. Distributed link services take this approach and imp...
Sanjay Vivek, Kenneth Tso, David De Roure
CCS
2009
ACM
14 years 9 months ago
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...
Kannan Srinathan, Arpita Patra, Ashish Choudhary, ...
JCP
2006
100views more  JCP 2006»
13 years 9 months ago
A Local Enumeration Protocol in Spite of Corrupted Data
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
Brahim Hamid, Mohamed Mosbah
HPCA
2011
IEEE
13 years 18 days ago
MOPED: Orchestrating interprocess message data on CMPs
Future CMPs will combine many simple cores with deep cache hierarchies. With more cores, cache resources per core are fewer, and must be shared carefully to avoid poor utilization...
Junli Gu, Steven S. Lumetta, Rakesh Kumar, Yihe Su...
ICCS
2004
Springer
14 years 2 months ago
Optimization of Collective Reduction Operations
A 5-year-profiling in production mode at the University of Stuttgart has shown that more than 40% of the execution time of Message Passing Interface (MPI) routines is spent in the...
Rolf Rabenseifner