Sciweavers

472 search results - page 25 / 95
» Shared memory programming for large scale machines
Sort
View
SC
1995
ACM
15 years 1 months ago
Communication Optimizations for Parallel Computing Using Data Access Information
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
Martin C. Rinard
CLUSTER
2007
IEEE
15 years 1 months ago
Identifying energy-efficient concurrency levels using machine learning
Abstract-- Multicore microprocessors have been largely motivated by the diminishing returns in performance and the increased power consumption of single-threaded ILP microprocessor...
Matthew Curtis-Maury, Karan Singh, Sally A. McKee,...
LCPC
2001
Springer
15 years 2 months ago
A Comparative Evaluation of Parallel Garbage Collector Implementations
While uniprocessor garbage collection is relatively well understood, experience with collectors for large multiprocessor servers is limited and it is unknown which techniques best ...
C. Richard Attanasio, David F. Bacon, Anthony Cocc...
SACI
2009
IEEE
15 years 4 months ago
Experiments on a grid layer prototype for shared data programming model
—In the grid context, there is little support for programming paradigms such as shared data or associative programming. We have previously proposed an original idea to attack sha...
Dacian Tudor, Georgiana Macariu, Wolfgang Schreine...
CIKM
2009
Springer
15 years 1 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...