Search

Your search keyword '"Bilardi, G"' showing total 89 results
Start Over Author "Bilardi, G"
89 results on '"Bilardi, G"'

1. QCD on the Cell Broadband Engine

Author

Belletti, F., Bilardi, G., Drochner, M., Eicker, N., Fodor, Z., Hierl, D., Kaldass, H., Lippert, T., Maurer, T., Meyer, N., Nobile, A., Pleiter, D., Schaefer, A., Schifano, F., Simma, H., Solbrig, S., Streuer, T., Tripiccione, R., and Wettig, T.

Subjects
High Energy Physics - Lattice
Abstract

We evaluate IBM's Enhanced Cell Broadband Engine (BE) as a possible building block of a new generation of lattice QCD machines. The Enhanced Cell BE will provide full support of double-precision floating-point arithmetics, including IEEE-compliant rounding. We have developed a performance model and applied it to relevant lattice QCD kernels. The performance estimates are supported by micro- and application-benchmarks that have been obtained on currently available Cell BE-based computers, such as IBM QS20 blades and PlayStation 3. The results are encouraging and show that this processor is an interesting option for lattice QCD applications. For a massively parallel machine on the basis of the Cell BE, an application-optimized network needs to be developed., Comment: 7 pages, 3 figures, contribution to Lattice 2007 (Regensburg, Germany)

Published
2007

9. The influence of key length on the area-time complexity of sorting

Author

Bilardi, G., Preparata, F. P., Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, and Brauer, Wilfried, editor

Published
1985
Full Text
View/download PDF

10. Digital filtering in VLSI

Author

Bilardi, G., Preparata, F. P., Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Makedon, Filia, editor, Mehlhorn, Kurt, editor, Papatheodorou, T., editor, and Spirakis, P., editor

Published
1986
Full Text
View/download PDF

13. AuroraScience Project. Report on the First Phase. July 31st, 2009 - April 22th, 2011

Author

Beccara, S, Alfieri, R, Artico, F, Bilardi, G, Brambilla, M, Boso, F, Cappelleri, V, Cestaro, A, Cilia, E, Cristoforetti, M, Dalla Brida, M, D’Antonio, M, Di Renzo, F, Faccioli, P, Fantozzi, C, Fontana, P, Gargano, C, Grossi, M, Illarionov, A, Leonardi, R, Leidemann, W, Milani, E, Moser, C, Onofri, E, Orlandini, G, Pederiva, F, Peruch, F, Peserico, E, Pietracaprina, A, Pivanti, M, Pozzati, F, Pucci, G, Richter, A, Sega, M, Schifano, S, Schimd, S, Scorzato, L, Simma, H, Skrbic, T, Tagliavini, E, Traini, M, Tripiccione, R, Velasco, V, Versaci, F, Yuan, L, Zago, N., DESTRI, CLAUDIO, MARCHESINI, GIUSEPPE, RAPUANO, FEDERICO, Beccara, S, Alfieri, R, Artico, F, Bilardi, G, Brambilla, M, Boso, F, Cappelleri, V, Cestaro, A, Cilia, E, Cristoforetti, M, Dalla Brida, M, D’Antonio, M, Di Renzo, F, Destri, C, Faccioli, P, Fantozzi, C, Fontana, P, Gargano, C, Grossi, M, Illarionov, A, Leonardi, R, Leidemann, W, Marchesini, G, Milani, E, Moser, C, Onofri, E, Orlandini, G, Pederiva, F, Peruch, F, Peserico, E, Pietracaprina, A, Pivanti, M, Pozzati, F, Pucci, G, Rapuano, F, Richter, A, Sega, M, Schifano, S, Schimd, S, Scorzato, L, Simma, H, Skrbic, T, Tagliavini, E, Traini, M, Tripiccione, R, Velasco, V, Versaci, F, Yuan, L, and Zago, N

Subjects
aurorascience
Published
2012

19. Status of the AuroraScience Project

Author

Beccara, S, Alfieri, R, Artico, F, Bilardi, G, Brambilla, M, Boso, F, Cappelleri, V, Cestaro, A, Cilia, E, Cristoforetti, M, Dalla Brida, M, D'Antonio, M, Di Renzo, F, Destri, C, Faccioli, P, Fantozzi, C, Fontana, P, Gargano, G, Giusti, L, Grossi, M, Illarionov, A, Leonardi, R, Leidemann, W, Marchesini, G, Milani, E, Moser, C, Onofri, E, Orlandini, G, Pederiva, F, Peruch, F, Peserico, E, Pietracaprina, A, Pivanti, M, Pozzati, F, Pucci, G, Rapuano, F, Richter, A, Sega, M, Schifano, S, Schimd, M, Schwarzd, M, Scorzato, L, Simma, H, Skrbic, T, Tagliavini, E, Traini, M, Tripiccione, R, Velasco, R, Verrocchio, P, Versaci, F, Yuan, L, Zago, N, S. A. Beccara, R. Alfieri, F. Artico, G. Bilardi, M. Brambilla, F. Boso, V. M. Cappelleri, A. Cestaro, E. Cilia, M. Cristoforetti, M. Dalla Brida, M. D'Antonio, F. Di Renzo, DESTRI, CLAUDIO, P. Faccioli, C. Fantozzi, P. Fontana, G. Gargano, L. Giusti, M. Grossi, A. Y. Illarionov, R. Leonardi, W. Leidemann, G. Marchesini, E. Milani, C. Moser, E. Onofri, G. Orlandini, F. Pederiva, F. Peruch, E. Peserico, A. Pietracaprina, M. Pivanti, F. Pozzati, G. Pucci, RAPUANO, FEDERICO, A. Richter, M. Sega, S. F. Schifano, M. Schimd, M. Schwarzd, L. Scorzato, H. Simma, T. Skrbic, E. Tagliavini, M. Traini, R. Tripiccione, R. Velasco, P. Verrocchio, F. Versaci, L. Yuan, N. Zago, Beccara, S, Alfieri, R, Artico, F, Bilardi, G, Brambilla, M, Boso, F, Cappelleri, V, Cestaro, A, Cilia, E, Cristoforetti, M, Dalla Brida, M, D'Antonio, M, Di Renzo, F, Destri, C, Faccioli, P, Fantozzi, C, Fontana, P, Gargano, G, Giusti, L, Grossi, M, Illarionov, A, Leonardi, R, Leidemann, W, Marchesini, G, Milani, E, Moser, C, Onofri, E, Orlandini, G, Pederiva, F, Peruch, F, Peserico, E, Pietracaprina, A, Pivanti, M, Pozzati, F, Pucci, G, Rapuano, F, Richter, A, Sega, M, Schifano, S, Schimd, M, Schwarzd, M, Scorzato, L, Simma, H, Skrbic, T, Tagliavini, E, Traini, M, Tripiccione, R, Velasco, R, Verrocchio, P, Versaci, F, Yuan, L, Zago, N, S. A. Beccara, R. Alfieri, F. Artico, G. Bilardi, M. Brambilla, F. Boso, V. M. Cappelleri, A. Cestaro, E. Cilia, M. Cristoforetti, M. Dalla Brida, M. D'Antonio, F. Di Renzo, DESTRI, CLAUDIO, P. Faccioli, C. Fantozzi, P. Fontana, G. Gargano, L. Giusti, M. Grossi, A. Y. Illarionov, R. Leonardi, W. Leidemann, G. Marchesini, E. Milani, C. Moser, E. Onofri, G. Orlandini, F. Pederiva, F. Peruch, E. Peserico, A. Pietracaprina, M. Pivanti, F. Pozzati, G. Pucci, RAPUANO, FEDERICO, A. Richter, M. Sega, S. F. Schifano, M. Schimd, M. Schwarzd, L. Scorzato, H. Simma, T. Skrbic, E. Tagliavini, M. Traini, R. Tripiccione, R. Velasco, P. Verrocchio, F. Versaci, L. Yuan, and N. Zago

Abstract

AuroraScience is a research project aiming at developing a computer architecture which benefits from both state of the art components/solutions (multi-core processors, liquid cooling, InfiniBand) and a custom network (an FPGA-based implementation of a 3-D torus). We report on the status of the project

Published
2011

20. AuroraScience

Author

Beccara, S, Alfieri, R, Artico, F, Bilardi, G, Brambilla, M, Boso, F, Cappelleri, V, Cestaro, A, Cilia, E, Cristoforetti, M, Dalla Brida, M, D'Antonio, M, Di Renzo, F, Destri, C, Faccioli, P, Fantozzi, C, Fontana, P, Gargano, G, Giusti, L, Grossi, M, Illarionov, A, Leonardi, R, Leidemann, W, Marchesini, G, Milani, E, Moser, C, Onofri, E, Orlandini, G, Pederiva, F, Peruch, F, Peserico, E, Pietracaprina, A, Pivanti, M, Pozzati, F, Pucci, G, Rapuano, F, Richter, A, Sega, M, Schifano, S, Schimd, M, Schwarzd, M, Scorzato, L, Simma, H, Skrbic, T, Tagliavini, E, Traini, M, Tripiccione, R, Velasco, R, Verrocchio, P, Versaci, F, Yuan, L, Zago, N, S. A. Beccara, R. Alfieri, F. Artico, G. Bilardi, M. Brambilla, F. Boso, V. M. Cappelleri, A. Cestaro, E. Cilia, M. Cristoforetti, M. Dalla Brida, M. D'Antonio, F. Di Renzo, DESTRI, CLAUDIO, P. Faccioli, C. Fantozzi, P. Fontana, G. Gargano, L. Giusti, M. Grossi, A. Y. Illarionov, R. Leonardi, W. Leidemann, G. Marchesini, E. Milani, C. Moser, E. Onofri, G. Orlandini, F. Pederiva, F. Peruch, E. Peserico, A. Pietracaprina, M. Pivanti, F. Pozzati, G. Pucci, A. Richter, M. Sega, S. F. Schifano, M. Schimd, M. Schwarzd, L. Scorzato, H. Simma, T. Skrbic, E. Tagliavini, M. Traini, R. Tripiccione, R. Velasco, P. Verrocchio, F. Versaci, L. Yuan, N. Zago, RAPUANO, FEDERICO, Beccara, S, Alfieri, R, Artico, F, Bilardi, G, Brambilla, M, Boso, F, Cappelleri, V, Cestaro, A, Cilia, E, Cristoforetti, M, Dalla Brida, M, D'Antonio, M, Di Renzo, F, Destri, C, Faccioli, P, Fantozzi, C, Fontana, P, Gargano, G, Giusti, L, Grossi, M, Illarionov, A, Leonardi, R, Leidemann, W, Marchesini, G, Milani, E, Moser, C, Onofri, E, Orlandini, G, Pederiva, F, Peruch, F, Peserico, E, Pietracaprina, A, Pivanti, M, Pozzati, F, Pucci, G, Rapuano, F, Richter, A, Sega, M, Schifano, S, Schimd, M, Schwarzd, M, Scorzato, L, Simma, H, Skrbic, T, Tagliavini, E, Traini, M, Tripiccione, R, Velasco, R, Verrocchio, P, Versaci, F, Yuan, L, Zago, N, S. A. Beccara, R. Alfieri, F. Artico, G. Bilardi, M. Brambilla, F. Boso, V. M. Cappelleri, A. Cestaro, E. Cilia, M. Cristoforetti, M. Dalla Brida, M. D'Antonio, F. Di Renzo, DESTRI, CLAUDIO, P. Faccioli, C. Fantozzi, P. Fontana, G. Gargano, L. Giusti, M. Grossi, A. Y. Illarionov, R. Leonardi, W. Leidemann, G. Marchesini, E. Milani, C. Moser, E. Onofri, G. Orlandini, F. Pederiva, F. Peruch, E. Peserico, A. Pietracaprina, M. Pivanti, F. Pozzati, G. Pucci, A. Richter, M. Sega, S. F. Schifano, M. Schimd, M. Schwarzd, L. Scorzato, H. Simma, T. Skrbic, E. Tagliavini, M. Traini, R. Tripiccione, R. Velasco, P. Verrocchio, F. Versaci, L. Yuan, N. Zago, and RAPUANO, FEDERICO

Published
2010

21. Broadcast and other primitive operations on fat-trees

Author

Bilardi G., Codenotti B., Del Corso G., Pinotti M.C., and Resta G.

Subjects
Computer Science::Information Theory, Broadcast
Abstract

This paper analyzes the cost of performing broadcast, product and prefix computation on the ideal fat-tree, a model proposed here to capture distance and bandwidth properties common to a variety of fat-tree networks. Algorithms are developed and analyzed in terms of the capacity of channels at different levels of the fat-tree. Non trivial lower bounds are derived establishing the optimality of our algorithms for a wide range of channel capacities.

Published
1997

22. A lower bound for area-universal graphs

Author

Bilardi, G., Chaudhuri, S., Dubhashi, D., and Mehlhorn, K.

Subjects
TheoryofComputation_MISCELLANEOUS, Mathematics::Operator Algebras, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, TheoryofComputation_GENERAL, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

We establish a lower bound on the efficiency of area--universal circuits. The area $A_u$ of every graph $H$ that can host any graph $G$ of area (at most) $A$ with dilation $d$, and congestion $c \leq \sqrt{A}/\log\log A$ satisfies the tradeoff $$ A_u = \Omega ( A \log A / (c^2 \log (2d)) ). $$ In particular, if $A_u = O(A)$ then $\max(c,d) = \Omega(\sqrt{\log A} / \log\log A)$.

Published
1993

23. QCD on the Cell Broadband Engine

Author

Meyer, Nils, primary, Belletti, F., additional, Bilardi, G., additional, Drochner, M., additional, Eicker, N., additional, Fodor, Zoltan, additional, Hierl, Dieter, additional, Kaldass, H., additional, Lippert, Thomas, additional, Maurer, Thilo, additional, Nobile, Andrea, additional, Pleiter, Dirk, additional, Schafer, Andreas, additional, Schifano, F., additional, Simma, Hubert, additional, Solbrig, Stefan, additional, Streuer, Thomas, additional, Tripiccione, R., additional, and Wettig, Tilo, additional

Published
2008
Full Text
View/download PDF

43. The Correctness of Tison's Method for Generating Prime Implicants.

Author

ILLINOIS UNIV AT URBANA COORDINATED SCIENCE LAB, Loui,M C, Bilardi,G, ILLINOIS UNIV AT URBANA COORDINATED SCIENCE LAB, Loui,M C, and Bilardi,G

Abstract

Tison devised a generalized consensus method to generate the prime implicants of a switching function. The authors present a complete, rigorous proof of its correctness. (Author)

Published
1982

44. A Minimum Area VLSI (Very Large Scale Integrated Architecture for O(LOGN) Time Sorting.

Author

ILLINOIS UNIV AT URBANA APPLIED COMPUTATION THEORY GROUP, Bilardi,G, Preparata,F P, ILLINOIS UNIV AT URBANA APPLIED COMPUTATION THEORY GROUP, Bilardi,G, and Preparata,F P

Abstract

A generalization of a known class of parallel sorting algorithms is presented, together with a new architecture to execute them. A VLSI implementation is also proposed, and its area-time performance is discussed. It is shown that an algorithm in the class is executable in 0(logn) time by a chip occupying O(n2) area. The design is a typical instance of a 'hybrid architecture', resulting from the combination of well-known VLSI arrays as the orthogonal-trees and the cube-connected-cycles; it is also the first known to meet the AT21 = omega(n2log2n) lower bound for sorters of n words of length (1 + epsilon) and working in minimum 0(logn) time. (Author), Also available as Rept. no. R-1006

Published
1983

45. A Critique and an Appraisal of VLSI Models of Computation.

Author

ILLINOIS UNIV AT URBANA APPLIED COMPUTATION THEORY GROUP, Bilardi,G, Pracchi,M, Preparata,F P, ILLINOIS UNIV AT URBANA APPLIED COMPUTATION THEORY GROUP, Bilardi,G, Pracchi,M, and Preparata,F P

Abstract

The central question in the design and analysis of algorithms is the definition of the model of computation to be adopted. Indeed, performance becomes meaningful only in relation to a given model. This model is normally the simplified abstraction of a class of real or imaginary machines; for example, the RAM or Random-Access-Machine, is the model of practically the totality of existing (Von Neumann type) processors. The model of computation is the simplest possible, compatibly with the requirement of being realistic. In other words, while a model aims at capturing the essential traits of a system or technology, its simplicity is what enables theoretical appraisals of performance. In this paper the author evaluate various proposed VLSI models of computation. While there is consensus on the appraisal of chip area, controversy remains with regard to computation time. Thus they have analyzed in detail the propagation of signals on dispersive lines. The results are expressed in terms of a dimensional parameters characteristic of any given fabrication technology. The conclusion is that both current and projected silicon technologies fall within the realm of the capacitive model, where a dispersive line can be replaced by a capacitance proportional to its length., Also available as Rept. no. R-914.

Published
1981

Catalog

Books, media, physical & digital resources
See catalog results