Now showing items 1-12 of 12

    • Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared Memory Machines 

      Bilardi, Gianfranco; Nicolau, Alexandru (Cornell University, 1986-08)
      We propose a parallel algorithm, called adaptive bitonic sorting, which runs on a PRAC, a shared-memory multiprocessor where fetch and store conflicts are disallowed. On a $P$ processors PRAC, our algorithm achieves ...
    • Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size 

      Bilardi, Gianfranco; Preparata, Franco P. (Cornell University, 1988-04)
      The prefix problem consists of computing all the products $x_{0}x_{1} \ldots x_{j} (j = 0, \ldots,N - 1)$, given a sequence $x =(x_{0},x_{1},\ldots, x_{N-1})$ of elements in a semigroup. It is shown that there are unbounded ...
    • Deterministic On-Line Routing on Area-Universal Networks 

      Bay, Paul Edwin; Bilardi, Gianfranco (Cornell University, 1991-09)
      Two deterministic routing networks are presented: the pruned butterfly and the sorting fattree. Both networks are area-universal, i.e., they can simulate any other routing network fitting in similar area with polylogarithmic ...
    • Deterministic Simulations of PRAMs on Bounded Degree Networks 

      Herley, Kieran T.; Bilardi, Gianfranco (Cornell University, 1988-11)
      The problem of simulating a PRAM with $n$ processors and memory size $m \geq n$ on an $n$-node bounded degree network is considered. A scheme is presented which simulates an arbitrary PRAM step in $O ((\log n \log m)/\log ...
    • Efficient Computation of Interprocedural Control Dependence 

      Ezick, James; Bilardi, Gianfranco; Pingali, Keshav (Cornell University, 2001-09-06)
      Control dependence information is useful for a wide range of software maintenance and testing tasks. For example, program slicers use it to determine statements and predicates that might affect the value of a particular ...
    • Engineering: Cornell Quarterly, Vol.23, No.1 (Autumn 1988): A New Thrust in Electronics Research 

      Shealy, J. Richard; Krusius, J. Peter; Al-Omar, Abdul-Azeez; Weinzierl, Steven R.; Luk, Franklin T.; Schimmel, David E.; Torng, H. C.; Tang, C. L.; Bilardi, Gianfranco; Pollock, Clifford R. (Internet-First University Press, 1988)
      IN THIS ISSUE: Cornell and JSEP: A New Thrust in a Major Program of Electronics Research /2 ... Growing Crystalline Layers for New High-Speed Electron Devices /4 J. Richard Shealy ... Supercomputer Simulation for Understanding ...
    • Inductive Inference without Overgeneralization from Positive Examples 

      Kapur, Shyam; Bilardi, Gianfranco (Cornell University, 1989-11)
      Language learnability is investigated in the Gold paradigm of inductive inference from positive data. Angluin gave a characterization of learnable families in this framework. Here, learnability is studied when the learner ...
    • Language Learning without Overgeneralization 

      Kapur, Shyam; Bilardi, Gianfranco (Cornell University, 1990-11)
      Language learnability is investigated in the Gold paradigm of inductive inference from positive data. Angluin gave a characterization of learnable families in this framework. Here, learnability of families of recursive ...
    • Merging and Sorting Networks with the Topology of the Omega Network 

      Bilardi, Gianfranco (Cornell University, 1987-03)
      We consider a class of comparator networks obtained from the omega permutation network by replacing each switch with a comparator exchanger of arbitrary direction. These networks are all isomorphic to each other, have ...
    • Optimal Control Dependence Computation and the Roman Chariots Problem 

      Pingali, Keshav; Bilardi, Gianfranco (Cornell University, 1996-09)
      The control dependence relation plays a fundamental role in program restructuring and optimization. The usual representation of this relation is the control dependence graph (CDG), but the size of the CDG can grow ...
    • Size-Time Complexity of Boolean Networks for Prefix Computations 

      Bilardi, Gianfranco; Preparata, Franco P. (Cornell University, 1987-01)
      The prefix problem consists of computing all the products $x_{0}x_{1}\ldots x_{j} (j=0,\ldots,N-1)$, given a sequence $X = (x_{0},x_{1},\ldots,x_{N-1})$ of elements in a semigroup. In this paper we completely characterize ...
    • Time Lower Bounds for CREW-PRAM Computation of Monotone Functions 

      Bilardi, Gianfranco; Moitra, Abha (Cornell University, 1989-05)
      It is shown that the time to compute a monotone boolean function depending upon $n$ variables on a CREW-PRAM satisfies the lower bound $T = \Omega$(log $l$ + (log $n$)/$l$), where $l$ is the size of the largest prime ...