Sciweavers

5448 search results - page 398 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
IPPS
1997
IEEE
15 years 11 months ago
A Parallel Algorithm for Weighted Distance Transforms
This paper presents a parallel algorithm for the weighted distance transform and the nearest feature transform of an n 2 n binary image. We show that the algorithm runs in O(log n...
Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuza...
ESCIENCE
2006
IEEE
15 years 10 months ago
Soft Benchmarks-Based Application Performance Prediction Using a Minimum Training Set
Application execution time prediction is of key importance in making decisions about efficient usage of Grid resources. Grid services lack support of a generic application executi...
Farrukh Nadeem, Muhammad Murtaza Yousaf, Radu Prod...
HPCA
1995
IEEE
15 years 10 months ago
Reducing Communication Latency with Path Multiplexing in Optically Interconnected Multiprocessor Systems
—Reducing communication latency, which is a performance bottleneck in optically interconnected multiprocessor systems, is of prominent importance. A conventional approach for est...
Chunming Qiao, Rami G. Melhem
ISPDC
2008
IEEE
16 years 1 months ago
Performance Analysis of Grid DAG Scheduling Algorithms using MONARC Simulation Tool
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
Florin Pop, Ciprian Dobre, Valentin Cristea
GECCO
2005
Springer
16 years 9 days ago
A theoretical analysis of the HIFF problem
We present a theoretical analysis of Watson’s Hierarchicalif-and-only-if (HIFF) problem using a variety of tools. These include schema theory and course graining, the concept of...
Nicholas Freitag McPhee, Ellery Fussell Crane