Sciweavers

968 search results - page 106 / 194
» Evaluating Benchmark Subsetting Approaches
Sort
View
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
15 years 7 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...
TC
2008
15 years 1 months ago
Counter-Based Cache Replacement and Bypassing Algorithms
Recent studies have shown that, in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
Mazen Kharbutli, Yan Solihin
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
15 years 1 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
PLDI
2011
ACM
14 years 4 months ago
Automatic compilation of MATLAB programs for synergistic execution on heterogeneous processors
MATLAB is an array language, initially popular for rapid prototyping, but is now being increasingly used to develop production code for numerical and scientific applications. Typ...
Ashwin Prasad, Jayvant Anantpur, R. Govindarajan
COMSWARE
2008
IEEE
15 years 8 months ago
Tracking target using sensor networks: target detection and route activation under energy constraints
—In this paper we consider tracking a target moving in a 2D plane using a network of sensors, each of which is capable of detecting presence of the target in its vicinity and com...
Vaishali P. Sadaphal, Bijendra N. Jain