Parallelized Critical Path Search in Electrical Circuit Designs

References
[1] D. Bader, G. Cong, and J. Feo. On the Architectural Requirements
for Efficient Execution of Graph Algorithms. In
Proceedings of the 33rd International Conference on Parallel
Processing (ICPP), Oslo, Norway, June 14–17 2005.
[2] J. L. Bentley. Multidimensional Binary Search Trees used
for Associative Searching. Communications of the ACM,
18(9):509–517, 1975.
[3] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein.
Introduction to Algorithms. MIT Press and McGraw-Hill,
Cambridge, USA, 2001.
[4] R. Dechter and J. Pearl. Generalized Best-first Search Strategies
and the Optimality of A*. Journals of the ACM,
32(3):505–536, 1985.
[5] E. W. Dijkstra. A Note on Two Problems in Connexion with
Graphs. Numerische Mathematik, 1:269–271, 1959.
[6] P. Diniz, S. Plimpton, B. Hendrickson, and R. Leland. Parallel
Algorithms for Dynamically Partitioning Unstructured
Grids. In Proceedings of the 7th SIAM Conference on Parallel
Processing for Scientific Computing, San Francisco,
USA, Feb 15–17 1995.
[7] C. M. Fiduccia and R. M. Mattheyses. A Linear-time
Heuristic for Improving Network Partitions. In Proceedings
of 19th Conference on Design Automation (DAC), Las Vegas,
USA, June 14–16 1982.
[8] R. Finkel and J. L. Bentley. Quad Trees: A Data Structure
for Retrieval on Composite Keys. Acta Informatica, 4:1–9,
1974.
[9] M.-Y. Fu, J. Li, and P.-D. Zhou. Design and Implementation
of Bidirectional Dijkstra Algorithm. Journal of Beijing
Institute of Technology, 12(4):366–370, 2003.
[10] Intel Compiler Professional Editions.
http://software.intel.com/en-us/intel-compilers/, March
2009.
[11] S. Idwan and W. Etaiwi. Computing breadth first search in
large graph using hmetis partitioning. European Journal of
Scientific Research, 29(2):215–221, 2009.
[12] B. W. Kernighan and S. Lin. An Efficient Heuristic Procedure
for Partitioning Graphs. Bell Systems Technical Journal,
49(2):291–307, 1970.
[13] R. E. Korf, W. Zhang, I. Thayer, and H. Hohwald. Frontier
Search. Journal of the ACM, 52(5):715–748, 2005.
[14] R. Lohner, R. Ramamurti, and D. Martin. A Parallelizable
Load Balancing Algorithm. In Proceedings of the AIAA 31st
Aerospace Sciences Meeting and Exhibit, Reno, Nevada,
USA, Jan. 11–14 1993.
[15] M. Luby and P. Ragde. A Bidirectional Shortest-Path Algorithm
with Good Average-Case Behavior. Algorithmica,
4(4):551–567, 1989.
[16] R. H. Möhring, H. Schilling, B. Schütz, D. Wagner, and
T. Willhalm. Partitioning Graphs to Speedup Dijkstra’s
Algorithm. Journal of Experimental Algorithmics (JEA),
11:2.8, 2006.
[17] A. S. Nepomniaschaya and M. A. Dvoskina. A Simple Implementation
of Dijkstra’s Shortest Path Algorithm on Associative
Parallel Processors. Fundamenta Informaticae,
43(1–4):227–243, 2000.
[18] OpenSPARC. http://www.opensparc.net/, March 2009.
[19] Concept Engineering’s: RTLvision PRO.
http://www.concept.de/rtl index.html, March 2009.
[20] D. Scarpazza, O. Villa, and F. Petrini. Efficient breadthfirst
search on the cell/be processor. IEEE Transactions on
Parallel and Distributed Systems, 10:1381 – 1395, October
2008.
[21] C. Walshaw, M. Cross, and M. G. Everett. Dynamic Mesh
Partitioning: A Unified Optimisation and Load-balancing
Algorithm. Technical Report 95/IM/06, University of
Greenwich, UK, 1995.
[22] C. Walshaw, M. Cross, and M. G. Everett. Parallel Dynamic
Partitioning for Adaptive Unstructured Meshes. Journal of
Parallel and Distributed Computing, 47:102–108, 1997.