Sciweavers

5640 search results - page 357 / 1128
» Parallelizing the Data Cube
Sort
View
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...
ICDCS
1997
IEEE
15 years 11 months ago
Supporting Dynamic Space-sharing on Clusters of Non-dedicated Workstations
Clusters of workstations are increasingly being viewed as a cost-e ective alternative to parallel supercomputers. However, resource management and scheduling on workstations clust...
Abdur Chowdhury, Lisa D. Nicklas, Sanjeev Setia, E...
ARCS
2004
Springer
16 years 2 days ago
Reconfigurable OPTO-ASICs as base for future self-organizing CMOS cameras
: We investigated different parallel SIMD (single instruction multiple data) architectures based on pure programmable and reconfigurable approaches for their appropriateness for in...
Dietmar Fey, Daniel Schmidt 0003, Andreas Loos
ISPAN
1997
IEEE
15 years 11 months ago
A method for estimating optimal unrolling times for nested loops
Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not...
Akira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa
EUROPAR
2000
Springer
15 years 10 months ago
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping
Abstract. When parallelizing loop nests for distributed memory parallel computers, we have to specify when the different computations are carried out (computation scheduling), wher...
Alain Darte, Claude G. Diderich, Marc Gengler, Fr&...