Sciweavers

1074 search results - page 2 / 215
» Parallelizing post-placement timing optimization
Sort
View
RANDOM
1999
Springer
13 years 10 months ago
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
Seth Pettie, Vijaya Ramachandran
ICFEM
2009
Springer
13 years 4 months ago
A Time-Optimal On-the-Fly Parallel Algorithm for Model Checking of Weak LTL Properties
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
Jiri Barnat, Lubos Brim, Petr Rockai
APSCC
2008
IEEE
13 years 8 months ago
Optimizing the Execution Time of the SLA-based Workflow in the Grid with Parallel Processing Technology
Service Level Agreements (SLAs) is currently one of the major research topics in Grid Computing. Among many system components for the supporting of SLA-aware Gridbased workflow, t...
Dang Minh Quan, Jörn Altmann, Laurence Tianru...
WSC
1998
13 years 7 months ago
Combining Optimism Limiting Schemes in Time Warp Based Parallel Simulations
The Time Warp protocol is considered to be an effective synchronization mechanism for parallel discrete event simulation (PDES). However, it is widely recognized that it suffers o...
Kevin G. Jones, Samir Ranjan Das
VLDB
1997
ACM
140views Database» more  VLDB 1997»
13 years 10 months ago
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
Minos N. Garofalakis, Yannis E. Ioannidis