Sciweavers

8125 search results - page 417 / 1625
» Parallelism and evolutionary algorithms
Sort
View
COLOGNETWENTE
2008
15 years 6 months ago
Special Cases of Online Parallel Job Scheduling
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
Johann Hurink, Jacob Jan Paulus
ASAP
2006
IEEE
169views Hardware» more  ASAP 2006»
15 years 11 months ago
A Design Methodology for Hardware Acceleration of Adaptive Filter Algorithms in Image Processing
Massively parallel processor array architectures can be used as hardware accelerators for a plenty of dataflow dominant applications. Bilateral filtering is an example of a stat...
Hritam Dutta, Frank Hannig, Jürgen Teich, Ben...
CCGRID
2007
IEEE
15 years 11 months ago
A Simulation Study of Data Partitioning Algorithms for Multiple Clusters
Abstract— Recently we proposed algorithms for concurrent execution on multiple clusters [9]. In this case, data partitioning is done at two levels; first, the data is distribute...
Chen Yu, Dan C. Marinescu, Howard Jay Siegel, John...
JPDC
2006
134views more  JPDC 2006»
15 years 5 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
IPPS
1999
IEEE
15 years 9 months ago
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
Keqin Li, Xian-He Sun