Sciweavers

5183 search results - page 300 / 1037
» The Complexity of Distributions
Sort
View
186
Voted
IPPS
2003
IEEE
15 years 12 months ago
Quantifying Locality Effect in Data Access Delay: Memory logP
The application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter-node communication in a shared mem...
Kirk W. Cameron, Xian-He Sun
PODC
2010
ACM
15 years 8 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
IPPS
2005
IEEE
16 years 7 days ago
Virtual Gateways in the DECOS Integrated Architecture
— The DECOS architecture aims at combining the advantages of federated and integrated systems. The DECOS architecture divides the overall system into a set of nearly-independent ...
Roman Obermaisser, Philipp Peti, Hermann Kopetz
PDPTA
2007
15 years 8 months ago
Improving Performance and Server Resource Usage with Page
As web engineering evolves web based applications complexity grows in higher orders of magnitude. Is not uncommon to find in today web based applications complex and time consumin...
León Welicki, Oscar Sanjuán Mart&iac...
FSTTCS
2010
Springer
15 years 4 months ago
Global Escape in Multiparty Sessions
Abstract. This paper proposes a global escape mechanism which can handle unexpected or unwanted conditions changing the default execution of distributed communicational flows, pres...
Sara Capecchi, Elena Giachino, Nobuko Yoshida