Sciweavers

488 search results - page 44 / 98
» Using shared arrays in message-driven parallel programs
Sort
View
ISCAPDCS
2003
13 years 10 months ago
Parallel Relative Debugging with Dynamic Data Structures
This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering ...
David Abramson, Raphael A. Finkel, Donny Kurniawan...
CCGRID
2010
IEEE
13 years 6 months ago
Low-Cost Tuning of Two-Step Algorithms for Scheduling Mixed-Parallel Applications onto Homogeneous Clusters
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
Sascha Hunold
ICFP
2007
ACM
14 years 8 months ago
Feedback directed implicit parallelism
In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution o...
Tim Harris, Satnam Singh
ISCA
1993
IEEE
153views Hardware» more  ISCA 1993»
14 years 24 days ago
An Adaptive Cache Coherence Protocol Optimized for Migratory Sharing
Parallel programs that use critical sections and are executed on a shared-memory multiprocessor with a writeinvalidate protocol result in invalidation actions that could be elimin...
Per Stenström, Mats Brorsson, Lars Sandberg
COLCOM
2009
IEEE
14 years 1 months ago
DiSK: A distributed shared disk cache for HPC environments
Abstract—Data movement within high performance environments can be a large bottleneck to the overall performance of programs. With the addition of continuous storage and usage of...
Brandon Szeliga, Tung Nguyen, Weisong Shi