1497 search results - page 24 / 300 » A Computational Model for Message Passing |
ICPP
1996
IEEE
15 years 4 months ago
1996
IEEE
In s-to-p broadcasting, s processors in a p-processor machine contain a message to be broadcast to all the processors, 1 s p. We present a number of different broadcasting algori...
182
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
Basic message processing tasks, such as wellformedness checking and grammar validation, can be off-loaded from the service providers' own infrastructures. To enable effective...
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
CONCUR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...
118
click to vote
EAGC
2004
Springer
15 years 5 months ago
2004
Springer
Application monitoring in the grid for parallel applications is hardly supported in recent grid infrastructures. There is a need to visualize the behavior of the program during its...