Sciweavers

7092 search results - page 690 / 1419
» Parallelizing constraint programs
Sort
View
228
Voted
HPCN
2000
Springer
15 years 10 months ago
An Analytical Model for a Class of Architectures under Master-Slave Paradigm
We build an analytical model for an application utilizing master-slave paradigm. In the model, only three architecture parameters are used: latency, bandwidth and flop rate. Instea...
Yasemin Yalçinkaya, Trond Steihaug
199
Voted
ICS
2011
Tsinghua U.
14 years 10 months ago
Scalable fine-grained call path tracing
Applications must scale well to make efficient use of even medium-scale parallel systems. Because scaling problems are often difficult to diagnose, there is a critical need for sc...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
ICPP
2008
IEEE
16 years 1 months ago
Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
Guojing Cong, Sreedhar B. Kodali, Sriram Krishnamo...
IPPS
2007
IEEE
16 years 1 months ago
Automatic MPI application transformation with ASPhALT
This paper describes a source to source compilation tool for optimizing MPI-based parallel applications. This tool is able to automatically apply a “prepushing” transformation...
Anthony Danalis, Lori L. Pollock, D. Martin Swany
IPPS
2006
IEEE
16 years 24 days ago
Loosely-coupled loop scheduling in computational grids
Loop distribution is one of the most useful techniques to reduce the execution time of parallel applications. Traditionally, loop scheduling algorithms are implemented based on pa...
Jose Herrera, Eduardo Huedo, Rubén S. Monte...