Sciweavers

10805 search results - page 263 / 2161
» Mapping Computation with No Memory
Sort
View
JSSPP
2001
Springer
15 years 11 months ago
Coscheduling under Memory Constraints in a NOW Environment
Networks of Workstations (NOW) have become important and cost-effective parallel platforms for scientific computations. In practice, a NOW system is heterogeneous and non-dedicat...
Francesc Giné, Francesc Solsona, Porfidio H...
IPPS
1997
IEEE
15 years 11 months ago
Maintaining Spatial Data Sets in Distributed-Memory Machines
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
Susanne E. Hambrusch, Ashfaq A. Khokhar
COMPLEX
2009
Springer
15 years 10 months ago
Non-sufficient Memories That Are Sufficient for Prediction
The causal states of computational mechanics define the minimal sufficient (prescient) memory for a given stationary stochastic process. They induce the -machine which is a hidden...
Wolfgang Löhr, Nihat Ay
ACSC
2004
IEEE
15 years 10 months ago
Homeless and Home-based Lazy Release Consistency Protocols on Distributed Shared Memory
This paper describes the comparison between homeless and home-based Lazy Release Consistency (LRC) protocols which are used to implement Distributed Shared Memory (DSM) in cluster...
Byung-Hyun Yu, Zhiyi Huang, Stephen Cranefield, Ma...
ICPP
2009
IEEE
15 years 4 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...