Sciweavers

975 search results - page 141 / 195
» Locality Optimization for Program Instances
Sort
View
IISWC
2009
IEEE
14 years 3 months ago
Phoenix rebirth: Scalable MapReduce on a large-scale shared-memory system
Abstract—Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementin...
Richard M. Yoo, Anthony Romano, Christos Kozyrakis
INFOCOM
2007
IEEE
14 years 3 months ago
Cost and Collision Minimizing Forwarding Schemes for Wireless Sensor Networks
—The paper presents a novel integrated MAC/routing scheme for wireless sensor networking. Our design objective is to elect the next hop for data forwarding by minimizing the numb...
Michele Rossi, Nicola Bui, Michele Zorzi
EUROGP
1999
Springer
166views Optimization» more  EUROGP 1999»
14 years 1 months ago
Adapting the Fitness Function in GP for Data Mining
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
Jeroen Eggermont, A. E. Eiben, Jano I. van Hemert
JCP
2008
135views more  JCP 2008»
13 years 9 months ago
Hybrid Evolutionary Algorithm Based Solution for Register Allocation for Embedded Systems
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...
Anjali Mahajan, M. S. Ali
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
14 years 2 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...