Sciweavers

169 search results - page 2 / 34
» Fine-Grained Timing Using Genetic Programming
Sort
View
HPCA
2002
IEEE
13 years 9 months ago
Fine-Grain Priority Scheduling on Multi-Channel Memory Systems
Configurations of contemporary DRAM memory systems become increasingly complex. A recent study [5] shows that application performance is highly sensitive to choices of configura...
Zhichun Zhu, Zhao Zhang, Xiaodong Zhang
IEEEPACT
1998
IEEE
13 years 8 months ago
A New Heuristic for Scheduling Parallel Programs on Multiprocessor
In this paper, we present an efficient algorithm, called CASS-II, for task clustering without task duplication. Unlike the DSC algorithm, which is empirically the best known algor...
Jing-Chiou Liou, Michael A. Palis
DAGSTUHL
2007
13 years 5 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
HPDC
2007
IEEE
13 years 10 months ago
Failure-aware checkpointing in fine-grained cycle sharing systems
Fine-Grained Cycle Sharing (FGCS) systems aim at utilizing the large amount of idle computational resources available on the Internet. Such systems allow guest jobs to run on a ho...
Xiaojuan Ren, Rudolf Eigenmann, Saurabh Bagchi
GECCO
2006
Springer
144views Optimization» more  GECCO 2006»
13 years 8 months ago
When lisp is faster than C
This paper compares the performance of the program evaluation phase of genetic programming using C and Common Lisp. A simple experiment is conducted, and the conclusion is that ge...
Børge Svingen