Sciweavers

2924 search results - page 412 / 585
» Lower Bounds in Distributed Computing
Sort
View
CONCUR
2009
Springer
15 years 11 months ago
Encoding Asynchronous Interactions Using Open Petri Nets
Abstract. We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open ...
Paolo Baldan, Filippo Bonchi, Fabio Gadducci
ICDCS
2008
IEEE
15 years 11 months ago
Scalable and Adaptive Metadata Management in Ultra Large-Scale File Systems
This paper presents a scalable and adaptive decentralized metadata lookup scheme for ultra large-scale file systems (≥ Petabytes or even Exabytes). Our scheme logically organiz...
Yu Hua, Yifeng Zhu, Hong Jiang, Dan Feng, Lei Tian
IPPS
2008
IEEE
15 years 11 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
IPPS
2007
IEEE
15 years 11 months ago
Probability Convergence in a Multithreaded Counting Application
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
Chad Scherrer, Nathaniel Beagley, Jarek Nieplocha,...
GCC
2007
Springer
15 years 11 months ago
Dynamic Data Replication based on Local Optimization Principle in Data Grid
Efficient data access is one way of improving the performance of the Data Grid. In order to speed up the data access and reduce bandwidth consumption, Data Grid replicates essenti...
Yulai Yuan, Yongwei Wu, Guangwen Yang, Feng Yu