Sciweavers

4276 search results - page 466 / 856
» Computability of Probability Distributions and Distribution ...
Sort
View
IPL
2011
91views more  IPL 2011»
14 years 10 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
IPPS
2005
IEEE
16 years 10 days ago
Stream PRAM
Parallel random access memory, or PRAM, is a now venerable model of parallel computation that that still retains its usefulness for the design and analysis of parallel algorithms....
Darrell R. Ulm, Michael Scherger
CCGRID
2004
IEEE
15 years 10 months ago
Routing and resource discovery in Phoenix Grid-enabled message passing library
We describe design and implementation of a "Gridenabled" message passing library, in the context of Phoenix message passing model. It supports (1) message routing betwee...
Kenji Kaneda, Kenjiro Taura, Akinori Yonezawa
CCGRID
2006
IEEE
15 years 10 months ago
Compilation of XSLT into Dataflow Graphs for Web Service Composition
Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and ...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...
SAC
2002
ACM
15 years 6 months ago
A comprehensive model for arbitrary result extraction
Within the realms of workflow management and grid computing, scheduling of distributed services is a central issue. Most schedulers balance time and cost to fit within a client�...
Neal Sample, Dorothea Beringer, Gio Wiederhold