SelectedWorks - Ronald Greenberg

Contact

Ronald Greenberg

Associate Professor of Computer Science and Undergraduate Program Director

Works
About

×

About Ronald Greenberg

Present	Associate Professor of Computer Science and Undergraduate Program Director, Loyola University Chicago ‐ Department of Computer Science
Institution Organization Position Type Position Title Time Period to Options Current Position Affiliate my profile with this Institution

Computer Sciences, OS and Networks, and Systems Architecture

Dr. Greenberg's main research efforts have been on identifying good networks for general-purpose parallel computing and developing algorithms in a number of application areas, e.g., routing messages on networks, VLSI wire routing, and sequence analysis problems of interest to computational biologists.

My Materials Supporting the Exploring Computer Science Curriculum

Computer Science: Faculty Publications and Other Works (2012)

Ronald I. Greenberg

Ready-made handouts and other resources supporting the Exploring Computer Science (introductory high school) curriculum are provided for Units 1 through ...

Open Source Classroom Polling (Interactive Response) Facility

Computer Science: Faculty Publications and Other Works (2012)

Ronald I. Greenberg

The contents of the UNIX directory resulting from unzipping the .zip file provide a demonstration of a simple polling facililty ...

Fast and Simple Computation of All Longest Common Subsequences

Computer Science Research Repository (2011)

Ronald I. Greenberg

This paper shows that a simple algorithm produces the all-prefixes-LCSs-graph in O(mn) time for two input sequences of size m ...

Bounds on the Number of Longest Common Subsequences.

Computer Science Research Repository (2003)

Ronald I. Greenberg

This paper performs the analysis necessary to bound the running time of known, efficient algorithms for generating all longest common ...

Fast and Space-Efficient Location of Heavy or Dense Segments in ...

COCOON: Ninth International Computing and Combinatorics Conference (2003)

Ronald I. Greenberg

This paper considers several variations of an optimization problem with potential applications in such areas as biomolecular sequence analysis and ...

Computing the Number of Longest Common Subsequences

Computer Science Research Repository (2003)

Ronald I. Greenberg

This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings ...

Fast and Space-Efficient Location of Heavy or Dense Segments in ...

Computing and Combinatorics Conference (2003)

Ronald I. Greenberg

On the Area of Hypercube Layouts

Information Processing Letters (2002)

Ronald I. Greenberg and Lee Guan

This paper precisely analyzes the wire density and required area in standard styles for the hypercube. It shows that the ...

Modeling and Comparison of Wormhole Routed Mesh and Torus Networks

Proceedings of the Ninth IASTED International Conference on Parallel and Distributed Computing and Systems (1997)

Ronald I. Greenberg and Lee Guan

2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel computers. In addition, wormhole routing has ...

An Improved Analytical Model for Wormhole Routed Networks with Application ...

Proceedings of the 1997 International Conference on Parallel Processing (1997)

Ronald I. Greenberg and Lee Guan

A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree ...

Universal Wormhole Routing

IEEE Transactions on Parallel and Distributed Systems (1997)

Ronald I. Greenberg and Hyeong-Cheol Oh

In this paper, we examine the wormhole routing problem in terms of the “congestion” c and “dilation” d for a ...

Minimizing Channel Density with Movable Terminals

Algorithmica (1997)

Ronald I. Greenberg and Jau-Der Shih

We give algorithms to minimize density for VLSI channel routing problems with terminals that are movable subject to certain constraints. ...

Parallel Algorithms for Single-Layer Channel Routing

Parallel Processing Letters (1997)

Ronald I. Greenberg, Shih-Chuan Hung and Jau-Der Shih

We provide efficient parallel algorithms for the minimum separation, offset range, and optimal offset problems for single-layer channel routing. We ...

An Empirical Comparison of Networks and Routing Strategies for Parallel ...

Proceedings of the Eighth IASTED International Conference on Parallel and Distributed Computing and Systems (1996)

Ronald I. Greenberg and Lee Guan

This paper compares message routing capabilities of important networks proposed for general-purpose parallel computing. All the networks have been proven ...

An Empirical Comparison of Area-Universal and Other Parallel Computing Networks

Proceedings of the ISCA 9th International Conference on Parallel and Distributed Computing Systems (1996)

Ronald I. Greenberg and Lee Guan

This paper provides empirical comparison of the communication capabilities of two area-universal networks, the fat-tree and the fat-pyramid, to the ...

Some Applications of Sophisticated Mathematics to Randomized Computing

Conference in Honor of the 90th Birthday of Professor Arnold Ross at Ohio State University, Columbus, OH (1996)

Ronald I. Greenberg

Single-Layer Channel Routing and Placement with Single-Sided Nets

Computers & Mathematics With Applications (1996)

Ronald I. Greenberg and Jau-Der Shih

This paper considers the optimal offset, feasible offset, and optimal placement problems for a more general form of single-layer VLSI ...

Packet Routing in Networks with Long Wires

Journal of Parallel and Distributed Computing (1995)

Ronald I. Greenberg and Hyeong-Cheol Oh

In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem ...

Feasible Offset and Optimal Offset for General Single-Layer Channel Routing

SIAM Journal on Discrete Mathematics (1995)

Ronald I. Greenberg and Jau-Der Shih

This paper provides an efficient method to find all feasible offsets for a given separation in a very large-scale integration ...

Finding Connected Components on a Scan Line Array Processor

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures (1995)

Ronald I. Greenberg

This paper provides a new approach to labeling the connected components of an n x n image on a scan ...

The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay

IEEE Trans. Computers (1994)

Ronald I. Greenberg

This paper shows that a fat-pyramid of area Θ(A) requires only O(log A) slowdown to simulate any competing network of ...

Parallel Algorithms for Single-Layer Channel Routing

Proceedings of the 4th Annual International Symposium on Algorithms and Computation (1993)

Ronald I. Greenberg, Shih-Chuan Hung and Jau-Der Shih

We provide efficient parallel algorithms for the minimum separation, offset range, and optimal offset problems for single-layer channel routing. We ...

Parallel algorithms for single-layer channel routing

ISAAC '93 Proceedings (1993)

Ronald I. Greenberg, Shih-Chuan Hung and Jau-Der Shih

We provide efficient parallel algorithms for the minimum separation, offset range, and optimal offset problems for single-layer channel routing. We ...

Universal Wormhole Routing

Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing (1993)

Ronald I. Greenberg and Hyeong-Cheol Oh

We examine the wormhole routing problem in terms of the "congestion" c and "dilation" d for a set of packet ...

Routing schemes for packets on Fat-Trees

Ronald I. Greenberg and H.-C. Oh