Sciweavers

JSS
1998
90views more  JSS 1998»
13 years 4 months ago
A taxonomy of distributed termination detection algorithms
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
Jeff Matocha, Tracy Camp
ACSW
2006
13 years 6 months ago
Building computational grids with apple's Xgrid middleware
Apple's release of the Xgrid framework for distributed computing introduces a new technology solution for loosely coupled distributed computation. In this paper systematicall...
Baden Hughes
NIPS
2007
13 years 6 months ago
Distributed Inference for Latent Dirichlet Allocation
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
David Newman, Arthur Asuncion, Padhraic Smyth, Max...
ATAL
2003
Springer
13 years 8 months ago
Posit spaces: a performative model of e-commerce
What distinguishes e-commerce from ordinary commerce? What distinguishes it from distributed computation? In this paper we propose a performative theory of e-commerce, drawing on ...
Peter McBurney, Simon Parsons
WDAG
1994
Springer
123views Algorithms» more  WDAG 1994»
13 years 9 months ago
Breakpoints and Time in Distributed Computations
This paper investigates how vector time can be used to set breakpoints in distributed computations for the purpose of analyzing and debugging distributed programs. A breakpoint is ...
Twan Basten
ICEIS
2000
IEEE
13 years 9 months ago
Architectural Considerations with Distributed Computing
We understand distributed systems as a collection of distributed computation resources that work together as one harmonious system. It is the great achievement of computer network...
Yibing Wang, Robert M. Hyatt, Barrett R. Bryant
TACS
2001
Springer
13 years 9 months ago
A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation
We propose the πD -calculus, a process calculus that can flexibly model fine-grained control of resource access in distributed computation, with a type system that statically pr...
Daisuke Hoshina, Eijiro Sumii, Akinori Yonezawa
ESWS
2010
Springer
13 years 9 months ago
OWL Reasoning with WebPIE: Calculating the Closure of 100 Billion Triples
Abstract. In previous work we have shown that the MapReduce framework for distributed computation can be deployed for highly scalable inference over RDF graphs under the RDF Schema...
Jacopo Urbani, Spyros Kotoulas, Jason Maassen, Fra...
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
13 years 10 months ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman
IPSN
2004
Springer
13 years 10 months ago
Locally constructed algorithms for distributed computations in ad-hoc networks
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
Dzulkifli S. Scherber, Haralabos C. Papadopoulos