Sciweavers

1753 search results - page 216 / 351
» Dynamic Scan Scheduling
Sort
View
151
Voted
ICFP
2010
ACM
15 years 3 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
IISWC
2006
IEEE
15 years 9 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
ALGOSENSORS
2004
Springer
15 years 8 months ago
A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
Abstract. Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule tra...
Ted Herman, Sébastien Tixeuil
116
Voted
ICPP
2003
IEEE
15 years 8 months ago
A Parallel Algorithm for Enumerating Combinations
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
Martha Torres, Alfredo Goldman, Junior Barrera
COMPSAC
2004
IEEE
15 years 7 months ago
Adaptive Time-Critical Resource Management Using Time/Utility Functions: Past, Present, and Future
Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably, the most effective and broadest approach for adapti...
Peng Li, Binoy Ravindran, E. Douglas Jensen