Sciweavers

6004 search results - page 678 / 1201
» Parallelizing query optimization
Sort
View
PC
2002
82views Management» more  PC 2002»
15 years 4 months ago
Time-minimal tiling when rise is larger than zero
This paper presents a solution to the open problem of finding the optimal tile size to minimise the execution time of a parallelogram-shaped iteration space on a distributed memory...
Jingling Xue, Wentong Cai
DATE
2007
IEEE
88views Hardware» more  DATE 2007»
15 years 11 months ago
Trade-off design of analog circuits using goal attainment and "Wave Front" sequential quadratic programming
One of the main tasks in analog design is the sizing of the circuit parameters, such as transistor lengths and widths, in order to obtain optimal circuit performances, such as hig...
Daniel Mueller, Helmut E. Graeb, Ulf Schlichtmann
ICDCSW
2006
IEEE
15 years 10 months ago
Dimension-Based Subscription Pruning for Publish/Subscribe Systems
Subscription pruning has been proven as valuable routing optimization for Boolean subscriptions in publish/subscribe systems. It aims at optimizing subscriptions independently of ...
Sven Bittner, Annika Hinze
ICS
2005
Tsinghua U.
15 years 10 months ago
Think globally, search locally
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
Kamen Yotov, Keshav Pingali, Paul Stodghill
EUROPAR
2003
Springer
15 years 10 months ago
Partial Redundancy Elimination with Predication Techniques
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication opti...
Bernhard Scholz, Eduard Mehofer, R. Nigel Horspool