Sciweavers

PACT
1997
Springer
13 years 12 months ago
Parallel and Distributed Evolutionary Computation with MANIFOLD
Abstract. In this paper, we apply a competitive coevolutionary approach using loosely coupled genetic algorithms to a distributed optimization of the Rosenbrock's function. Th...
Franciszek Seredynski, Pascal Bouvry, Farhad Arbab
PACT
1997
Springer
13 years 12 months ago
Viability of Multithreading on Networks of Workstations
Abstract. Recent trend in high-performance computing focuses on networks of workstations (NOWs) as a way ofrealizing cost-effective parallel machines. This has been due to the avai...
Hantak Kwak, Ben Lee, Ali R. Hurson
PACT
1997
Springer
13 years 12 months ago
Control-Driven Coordination Programming in Shared Dataspace
This paper argues for an alternative way of designing coordination models for parallel and distributed environments based on a complete symmetry between and decoupling of producers...
George A. Papadopoulos, Farhad Arbab
PACT
1997
Springer
13 years 12 months ago
Estimating the Parallel Start-Up Overhead for Parallelizing Compilers
A technique for estimating the cost of executing a loop nest in parallel (parallel start-up overhead) is described in this paper. This technique is of utmost importance for paralle...
Rizos Sakellariou
SPAA
1996
ACM
13 years 12 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
SPAA
1996
ACM
13 years 12 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
SPAA
1996
ACM
13 years 12 months ago
On the Benefit of Supporting Virtual Channels in Wormhole Routers
Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman
SPAA
1996
ACM
13 years 12 months ago
An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...
SPAA
1996
ACM
13 years 12 months ago
BSP vs LogP
A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, alth...
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietr...
JSSPP
1997
Springer
13 years 12 months ago
Implications of I/O for Gang Scheduled Workloads
This paper examinestheimplicationsofgang schedulingfor generalpurpose multiprocessors. The workloads in these environments include both compute-bound parallel jobs, which often re...
Walter Lee, Matthew Frank, Victor Lee, Kenneth Mac...