Sciweavers

4795 search results - page 24 / 959
» The Message Classification Model
Sort
View
IPPS
2000
IEEE
15 years 2 months ago
Fast Measurement of LogP Parameters for Message Passing Platforms
Abstract. Performance modeling is important for implementing efficient parallel applications and runtime systems. The LogP model captures the relevant aspects of message passing i...
Thilo Kielmann, Henri E. Bal, Kees Verstoep
DANTE
1999
IEEE
154views Database» more  DANTE 1999»
15 years 2 months ago
Adapting Transactions to Exceptional Situations Using Structured Messages
We concentrate on the property that the progression of collaborative work involves communication among participants, and we consider a flexible method for managing transactions ut...
Sozo Inoue, Mizuho Iwaihara
ACL
1994
14 years 11 months ago
A Corpus-Based Approach to Automatic Compound Extraction
An automatic compound retrieval method is proposed to extract compounds within a text message. It uses n-gram mutual information, relative frequency count and parts of speech as t...
Keh-Yih Su, Ming-Wen Wu, Jing-Shin Chang
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
14 years 9 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
David Peleg, Vitaly Rubinovich
PODC
1998
ACM
15 years 2 months ago
Persistent Messages in Local Transactions
: We present a new model for handling messages and state in a distributed application that we call Messages in Local Transactions (MLT). Under this model, messages and data are not...
David E. Lowell, Peter M. Chen