2110 search results - page 85 / 422 » What is the complexity of a distributed computing system |
142
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Locally and functionally distributed applications realized on different system architectures demand a universal, portable and intuitive software utility for interprocess communica...
125
click to vote
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a performance study of a nonrigid registration algorithm for investigating lung disease on clusters. Our algorithm combines two conventional acceleration techn...
141
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—The realistic performance of a multi-input multi-output (MIMO) communication system depends strongly on the spatial correlation properties introduced by clustering in the propag...
128
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
133
Voted
LATA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...