Sciweavers

1497 search results - page 96 / 300
» A Computational Model for Message Passing
Sort
View
ECRTS
1999
IEEE
14 years 22 days ago
Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach
In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET's medium ac...
Eduardo Tovar, Francisco Vasques, Alan Burns
CLUSTER
2011
IEEE
12 years 8 months ago
Dynamic Load Balance for Optimized Message Logging in Fault Tolerant HPC Applications
—Computing systems will grow significantly larger in the near future to satisfy the needs of computational scientists in areas like climate modeling, biophysics and cosmology. S...
Esteban Meneses, Laxmikant V. Kalé, Greg Br...
GROUP
2005
ACM
14 years 2 months ago
Unraveling the ordering in persistent chat: a new message ordering feature
A common problem in chat is that the chat display only reveals the temporal order of the conversation. A better user interface is desired that reveals the logical order of the mes...
Lu Xiao, Jayne S. Litzinger
IANDC
2007
84views more  IANDC 2007»
13 years 8 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
EUROCRYPT
2008
Springer
13 years 10 months ago
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
Kaoru Kurosawa, Kazuhiro Suzuki