Sciweavers

2219 search results - page 129 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ISPAN
2002
IEEE
15 years 7 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
CLUSTER
2006
IEEE
15 years 2 months ago
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
Jiannong Cao, Alvin T. S. Chan, Yudong Sun, Sajal ...
IJPP
2011
99views more  IJPP 2011»
14 years 9 months ago
Regular Lattice and Small-World Spin Model Simulations Using CUDA and GPUs
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
150
Voted
ICSM
2002
IEEE
15 years 7 months ago
Static and Dynamic C++ Code Analysis for the Recovery of the Object Diagram
When a software system enters the maintenance phase, the availability of accurate and consistent information about its organization can help alleviate the difficulties of program...
Paolo Tonella, Alessandra Potrich
GC
2004
Springer
15 years 7 months ago
BGP-Based Clustering for Scalable and Reliable Gossip Broadcast
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
M. Brahami, Patrick Th. Eugster, Rachid Guerraoui,...