Sciweavers

ISCAPDCS
2004
13 years 6 months ago
Practical Byzantine Fault Tolerance Using Fewer than 3f+1 Active Replicas
Byzantine fault tolerant state machine replication (BFT-SMR) is a foundation for implementations of highly reliable services. Existing algorithms for BFT-SMR require at least 3f +...
Ming Li, Yuval Tamir
ISCAPDCS
2004
13 years 6 months ago
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps...
Yamin Li, Shietung Peng, Wanming Chu
ISCAPDCS
2004
13 years 6 months ago
Building Collaborative Environments for Advanced Computing
Abstract. Synchronous collaborative systems allow geographically distributed participants to form a virtual work environment enabling cooperation between peers and enriching the hu...
Gareth J. Lewis, S. Mehmood Hasan, Vassil N. Alexa...
ISCAPDCS
2004
13 years 6 months ago
Randomized Sorting on the POPS Network
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
Jaime Davila, Sanguthevar Rajasekaran
ISCAPDCS
2004
13 years 6 months ago
An Open Digest-based Technique for Spam Detection
A promising anti-spam technique consists in collecting users opinions that given email messages are spam and using this collective judgment to block message propagation to other u...
Ernesto Damiani, Sabrina De Capitani di Vimercati,...
ISCAPDCS
2004
13 years 6 months ago
FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...
Thomas H. Cormen, Elena Riccio Davidson
ISCAPDCS
2004
13 years 6 months ago
The Fat-Stack and Universal Routing in Interconnection Networks
This paper shows that a novel network called the fat-stack is universally efficient when adequate capacity distribution is provided and is suitable for use as an interconnection n...
Kevin F. Chen, Edwin Hsing-Mean Sha
ISCAPDCS
2004
13 years 6 months ago
Heuristics-Based Replication Schemas for Fast Information Retrieval over the Internet
Internet today, has transformed into a global information hub. The increase in its usage and magnitude have sparkled various research problems. Because of the diverse user populat...
Samee Ullah Khan, Ishfaq Ahmad
ISCAPDCS
2004
13 years 6 months ago
Fractal Computation in Step with Real-Time Dance
This paper describes a collaboration among computer scientists, dancers, and musicians on a production entitled "Fibonacci and Phi." Thematically, the production explore...
Jennifer J. Burg, Tim Miller