203 search results - page 29 / 41 » An O(nlogn) time algorithm for optimal buffer insertion |
IEEECIT
2010
IEEE
13 years 5 months ago
2010
IEEE
—The relevance of instruction parallelization and optimal event scheduling is currently increasing. In particular, because of the high amount of computational power available tod...
ICDE
2002
IEEE
14 years 8 months ago
2002
IEEE
We present a diff algorithm for XML data. This work is motivated by the support for change control in the context of the Xyleme project that is investigating dynamic warehouses ca...
PLDI
2005
ACM
14 years 8 days ago
2005
ACM
Modulo scheduling is an effective code generation technique that exploits the parallelism in program loops by overlapping iterations. One drawback of this optimization is that reg...
ITC
2002
IEEE
13 years 11 months ago
2002
IEEE
Significant reductions in test application times can be achieved through parallelizing core tests; however, simultaneous test of various cores may result in exceeding power thres...
SPAA
1990
ACM
13 years 10 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...