Automatic multithreading and multiprocessing of C programs for IXP

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2005, Pages 132-141

  Li, Long ^a   Huang, Bo ^a   Dai, Jinquan ^a   Harrison, Luddy ^b  

^a INTEL CORPORATION   (China)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Code Motion; Critical Section; Multi Processing; Multi Threading; Network Processor

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER NETWORKS; COMPUTER PROGRAMMING; PERFORMANCE; SYNCHRONIZATION;

CODE MOTION; MULTI-THREADING; NETWORK PROCESSOR;

MULTIPROCESSING SYSTEMS;

EID: 31844453249     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065944.1065963     Document Type: Conference Paper

References (27)

1. Challenges in Building Network Processor Based Solutions, http://www.futsoft.com/pdf/NPwp.pdf
2. Intel IXP family of Network Processors, www.intel.com/design/network/ products/npfamily/index.htm
3. IBM PowerNP Network Processors http://www-3.ibm.com/chips/techlib/ techlib.nsf/products/IBM_PowerNP_
4. NP4GS3
5. CPort Network Processor family, http://www.windriver.com/cgi-bin/ partnerships/directory/viewProd.cgi?id=1371
6. Agere's PayloadPlus Family of Network Processors, http://www.agere.com/ telecon/network_processors.html
7. AMCC's nP7xxx series of Network Processors, http://www.mmcnetworks.com/ solutions/
8. Introduction to the Auto-Partitioning Programming Model, http://www.intel.com/design/network/papers/25411401.pdf
9. C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall International Series in Computer Science, 1985. ISBN 0-13-153271-5 (0-13-153289-8 PBK).
10. Bjarne Steensgaard, Points-to Analysis in Almost Linear Time, In Proceedings of the ACM SIGPLAN /SIGACT Symposium on Principles of Programming Languages, 1996
11. S.P. Midkiff and D. Padua, Compiler algorithms for synchronization, IEEE Transactions on Computers, C-36(12), pages 1485-1495, Dec. 1987
12. Jens Knoop, Eliminating partially dead code in explicitly parallel programs, Theoretical Computer Science, v.196 n.1-2, p.365-393, April 6, 1998
13. Jens Knoop, Bernhard Steffen, Jürgen Vollmer, Parallelism for free: efficient and optimal bitvector analyses for parallel programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.3, p.268-299, May 1996
14. Ramakrishnan Rajamony, Alan Cox, Optimally Synchronizing DOACROSS Loops on Shared Memory Multiprocessors, in the proceedings of the 7997 International Conference on Parallel Architectures and Compilation Techniques (PACT'97), November 1997
15. Ding-Kai Chen, Pen-Chung Yew, Redundant synchronization elimination for DOACROSS loops, IEEE Transactions on Parallel and Distributed Systems, May 1999, pp. 459-470, Vol. 10 No. 5
16. Ron G. Cytron. Doacross, beyond vectorization for multiprocessors, Proceedings of the International Conference on Parallel Processing, pages 836-844, 1986
17. V. Krothapalli and P. Sadayappan, "Removal of Redundant Dependences in DOACROSS Loops With Constant Dependences", IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 3, pp. 281-289, 1991
18. Z.Li and W.Abu-Sufah, "On Reducing Data Synchronization in Multiprocessed Loops," IEEE Trans. Computers, vol. 36, no. 1, pp. 105-109, Jan. 1987
19. P.Shaffer, "Minimization of Interprocessor Synchronization in Multiprocessors with Shared and Private Memory", Proc. Int'l Conf. Parallel Processing, vol. III, pp. 138-141, Aug. 1989
20. D.Callahan, K.Kennedy, and J.Subhlok, "Analysis of Event Synchronization in a Parallel Programming Tool", Proc. Second ACM SIGPLAN Symp. Principles and Practice of Parallel Programming, pp. 21-30, Mar. 1990
21. J. Knoop, O. Ruthing, B. Steffen. Optimal code motion: Theory and practice. ACM Transactions on Programming Languages and Systems, 16(4): 1177-1155, July 1994
22. E. Morel and C. Renvoise. Global optimization by suppression of partial redundancies. Comm. ACM, 22(2):96-103, 1979
23. Jonathan Aldrich, Craig Chambers, Emin Gün Sirer and Susan Eggers. Eliminating Unnecessary Synchronization from Java Programs. In Proceedings of the Static Analyses Symposium, pages 19-38, Venice, Italy, September 1999
24. Jeff Bogda, Urs Hölzle,Removing unnecessary synchronization in Java, Conference on Object Oriented Programming Systems Languages and Application, Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, pp. 35-46
25. Lam, M. Software pipelining: an effective scheduling technique for VLIW machines. In Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation (June 1988), Volume 23 Issue 7
26. Rau, B. R. Iterative modulo scheduling: an algorithm for software pipelining loops. In Proceedings of the 27th annual international symposium on Microarchitecture (1994), ACM Press, pp. 63-74.
27. Network Processor Forum (NPF), IP Forwarding Benchmark Implementation Agreements (June 2003), http://www.npforum.org/benchmarking/ licenseagm_ipforwarding.shtml.