Sciweavers

252 search results - page 19 / 51
» Scalability in a Secure Distributed Proof System
Sort
View
CCS
2007
ACM
14 years 1 months ago
Automaton segmentation: a new approach to preserve privacy in xml information brokering
A Distributed Information Brokering System (DIBS) is a peer-to-peer overlay network that comprises diverse data servers and brokering components helping client queries locate the ...
Fengjun Li, Bo Luo, Peng Liu, Dongwon Lee, Chao-Hs...
CL
2007
Springer
13 years 7 months ago
A bulk-synchronous parallel process algebra
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
Armelle Merlin, Gaétan Hains
CCS
2009
ACM
14 years 2 months ago
Scalable onion routing with torsk
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of th...
Jon McLachlan, Andrew Tran, Nicholas Hopper, Yongd...
SP
2002
IEEE
147views Security Privacy» more  SP 2002»
13 years 7 months ago
CX: A scalable, robust network for parallel computing
CX, a network-based computational exchange, is presented. The system's design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks...
Peter R. Cappello, Dimitros Mourloukos
TPDS
1998
95views more  TPDS 1998»
13 years 7 months ago
Bound Performance Models of Heterogeneous Parallel Processing Systems
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
Simonetta Balsamo, Lorenzo Donatiello, Nico M. van...