Sciweavers

465 search results - page 34 / 93
» Dynamic Scheduling with Genetic Programming
Sort
View
IPPS
2005
IEEE
15 years 7 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
EMSOFT
2005
Springer
15 years 7 months ago
AutoDVS: an automatic, general-purpose, dynamic clock scheduling system for hand-held devices
We present AutoDVS, a dynamic voltage scaling (DVS) system for hand-held computers. Unlike extant DVS systems, AutoDVS distinguishes common, course-grain, program behavior and cou...
Selim Gurun, Chandra Krintz
IISWC
2006
IEEE
15 years 7 months ago
Load Instruction Characterization and Acceleration of the BioPerf Programs
The load instructions of some of the bioinformatics applications in the BioPerf suite possess interesting characteristics: only a few static loads cover almost the entire dynamic ...
Paruj Ratanaworabhan, Martin Burtscher
IPPS
2010
IEEE
14 years 11 months ago
Handling errors in parallel programs based on happens before relations
Abstract--Intervals are a new model for parallel programming based on an explicit happens before relation. Intervals permit fine-grained but high-level control of the program sched...
Nicholas D. Matsakis, Thomas R. Gross
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 5 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom