The potential of on-chip multiprocessing for QCD machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3769 LNCS, Issue , 2005, Pages 386-397

  Bilardi, Gianfranco ^a   Pietracaprina, Andrea ^a   Pucci, Geppino ^a   Schifano, Fabio ^b   Tripiccione, Raffaele ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF FERRARA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CHIP ORGANIZATION; MEMORY SYSTEM; OPTIMAL PARTITION; QUANTUM CHROMO DYNAMICS (QCD);

COMPUTATION THEORY; MICROPROCESSOR CHIPS; QUANTUM THEORY; STORAGE ALLOCATION (COMPUTER); VLSI CIRCUITS;

MULTIPROCESSING SYSTEMS;

EID: 33646729353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602569_41     Document Type: Conference Paper

References (38)

1. H. Abelson and P. Andreae. Information transfer and area-time tradeoffs for VLSI multiplication. Communications of the ACM, 23(1):20-23, 1980.
2. A. Aggarwal, A.K. Chandra, and M. Snir. Hierarchical memory with block transfer. In Proc. of the 28th IEEE Symp. on Foundations of Computer Science, pages 204-216, 1987.
3. A. Aggarwal and J.S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9): 1116-1127, 1988.
4. M. Albanese et al. The APE Computer: an Array Processor Optimized for Lattice gauge Theory Simulations. Comput. Phys. Commun. 45:345, 1987.
5. F. Allen et al. Blue Gene: a vision for protein science using a petaflop supercomputer. IBM Systems Journal, 40(2)310-327, 2001.
6. G. Almasi et al. Design and implementation of message passing services for the Blue Gene/L supercomputer. IBM J. Res. Develop., 49(2/3), 2005.
7. B. Alpern, L. Carter, E. Feig, and T. Selker. The uniform memory hierarchy model of computation. Algorithmica, 12(2/3):72-109, 1994.
8. C. Battista et al. The APE-100 Computer.-(I) the Architecture. Int. J. High Speed Computing 5:637, 1993.
9. J. Beetem, M. Denneau, and D. Weingarten. The GF11 supercomputer. In Proc. of 12th Int. Symposium on Computer Architecture, pages 108-115, 1985.
10. G. Bilardi, A. Pietracaprina, and P. D'Alberto. On the space and access complexity of computation dags. In Proc. of 26th Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 1928, pages 47-58, 2000.
11. G. Bilardi and F.P. Preparata. Area-time lower-bound techniques with application to sorting. Algorithmica, 1(1):65-91, 1986.
12. G. Bilardi and F.P. Preparata. Processor-time tradeoffs under bounded-speed message propagation: Part II, lower bounds. Theory of Computing Systems, 32:531-559, 1999.
13. G. Bilardi and M. Sarrafzadeh. Optimal VLSI circuits for the discrete Fourier transform. Advances in Computing Research 4:87-101, JAI Press, Greenwich Connecticut, 1987.
14. R.P. Brent and H.T. Kung. The chip complexity of binary arithmetic. J. Ass. Comp. Mach. 28(3):521-534, 1981.
15. D.Chen et al. QCDOC: A 10-teraflops scale computer for lattice QCD. In Proc. of 18th Intl. Symposium on Lattice Field Theory (Lattice 2000), Bangalore, India, August 2000.
16. ClearSpeed Site: www.clearspeed.com
17. J. Clouser et al A 600-MHz superscalar floating-point processor. IEEE Journal on Solid-State Circuits, 34(7):1026-1029, July 1999.
18. D.E. Culler, J.P. Singh, and A. Gupta. Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann, San Mateo, CA, 1999.
19. R. Cypher, Theoretical aspects of VLSI PIN limitations, SIAM J. Comput., Vol. 2, No.2, pp. 356-378, April 1993.
20. C. Fantozzi, A. Pietracaprina, and G. Pucci. Seamless integration of parallelism and memory hierarchy. In Proc. of 29th Int. Colloquium on Automata, Languages and Programming, LNCS 2380, pages 856-867, July 2002.
21. J.W. Hong and H.T. Kung. I/O complexity: The red-blue pebble game. In Proc. of the 13th ACM Symp. on Theory of Computing, pages 326-333, 1981.
22. Intel Itanium2 Site: www.intel.com/products/processor/itanium2/
23. Y. Iwasaki. Computers for lattice field theories. Nuclear Physics (Proc. Suppl.) 34:78, 1994.
24. J. Kahle, M. Suzuoki, Y. Masubuchi, Cell Microprocessor Briefing, San Francisco, February 7, 2005.
25. F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992.
26. S. Mueller et al The vector floating-point unit in a synergistic processor element of a Cell processor. In Proc. 17th IEEE Int. Symp. on Computer Arithmetic, June 2005. To Appear.
27. R.D. Mawhinney, The 1 Teraflops QCDSP Computer, Parallel Computing 25(10-11):1281-1296, 1999.
28. Parallel Computing, 25(10-11), 1999. Special Issue on High Performance Computing in LQCD.
29. M. Snir, I/O Limitations on multi-chip VLSI systems, Proc. 19th Allerton Conference on Communications, Control, and Computing, Monticello, IL, 1981, pp. 224-233.
30. S.M. Sze, editor. VLSI Technology. McGraw-Hill, New York NY, 2nd edition, 1988.
31. C.D. Thompson. A complexity theory for VLSI. PhD thesis, Dept. of Computer Science, Carnegie-Mellon University, Aug. 1980. Tech. Rep. CMU-CS-80-140.
32. The Top 500 Supercomputer Sites: http://www.top500.org.
33. R. Tripiccione. APEmille. Parallel Computing, 25(10-11):1297-1309, 1999.
34. R. Tripiccione. LGT simulations on APEmachines. Computer Physics Communications 139:55, 2001.
35. R. Tripiccione. Strategies for dedicated computing for lattice gauge theories. Computer Physics Communications 169:442-448, 2005.
36. TRIPS: Tera-op Reliable Intelligently adaptive Processing System. www.es.utexas.edu/users/cart/trips/.
37. J.D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville MD, 1984.
38. A.C.C. Yao. Some complexity questions related to distributive computing. In Proc. of the 11th ACM Symp. on Theory of Comp., pages 209-213, 1979.