Sciweavers

4800 search results - page 252 / 960
» OO Distributed Programming is Not Distributed OO Programming
Sort
View
ISCOPE
1999
Springer
15 years 7 months ago
Generic Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
IPCO
2004
107views Optimization» more  IPCO 2004»
15 years 4 months ago
A Robust Optimization Approach to Supply Chain Management
Abstract. We propose a general methodology based on robust optimization to address the problem of optimally controlling a supply chain subject to stochastic demand in discrete time...
Dimitris Bertsimas, Aurélie Thiele
ICPP
2009
IEEE
15 years 9 months ago
Speeding Up Distributed MapReduce Applications Using Hardware Accelerators
—In an attempt to increase the performance/cost ratio, large compute clusters are becoming heterogeneous at multiple levels: from asymmetric processors, to different system archi...
Yolanda Becerra, Vicenç Beltran, David Carr...
OOPSLA
1999
Springer
15 years 7 months ago
Object Views: Language Support for Intelligent Object Caching in Parallel and Distributed Computations
Object-based parallel and distributed applications are becoming increasingly popular, driven by the programmability advantages of component technology and a flat shared-object spa...
Ilya Lipkind, Igor Pechtchanski, Vijay Karamcheti
ICALP
1992
Springer
15 years 6 months ago
Near-perfect Token Distribution
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...