Sciweavers

1710 search results - page 90 / 342
» Parallelism in Structured Newton Computations
Sort
View
ICPP
2009
IEEE
14 years 7 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...
IPPS
2007
IEEE
15 years 4 months ago
A Portable Framework for High-Speed Parallel Producer/Consumers on Real CMP, SMT and SMP Architectures
This paper explores generating efficient, portable HighSpeed Producer Consumer (HSPC) code on current shared memory architectures: Chip Multi-Processors (CMP), Simultaneous Multi...
Richard T. Saunders, Clinton L. Jeffery, Derek T. ...
PDPTA
2010
14 years 7 months ago
Data-Parallelism and GPUs for Lattice Gas Fluid Simulations
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...
Mitchel Johnson, Daniel P. Playne, Kenneth A. Hawi...
IPPS
1998
IEEE
15 years 2 months ago
Optimizing Parallel Applications for Wide-Area Clusters
Recent developments in networking technology cause a growing interest in connecting local-area clusters of workstations over wide-area links, creating multilevel clusters, or meta...
Henri E. Bal, Aske Plaat, Mirjam G. Bakker, Peter ...
ICPR
2004
IEEE
15 years 11 months ago
Parallelizing Motion Segmentation by Perceptual Organization of XYT
The front end of many motion analysis algorithms is usually a process that generates bounding boxes around each moving object, roughly segmenting the objects from the background. ...
Daniel Majchrzak, Sudeep Sarkar