Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

José Cruz-Rivera

dblp:37/3168 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Interconnection networks and networks-on-chip · 46% Parallel and multicore computing · 24% Electronic design automation · 14%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › routing algorithms
adaptive routing
0.011998
The Offset Cube: A Three-Dimensional Multicomputer Network Topology Using Through-Wafer Optics · IEEE Trans. Parallel Distributed Syst. 1998
Interconnection networks and networks-on-chip › routing algorithms
deadlock-free routing
0.011998
The Offset Cube: A Three-Dimensional Multicomputer Network Topology Using Through-Wafer Optics · IEEE Trans. Parallel Distributed Syst. 1998
Interconnection networks and networks-on-chip
network topology
0.011998
The Offset Cube: A Three-Dimensional Multicomputer Network Topology Using Through-Wafer Optics · IEEE Trans. Parallel Distributed Syst. 1998
Electronic design automation › physical design
routing
0.011998
The Offset Cube: A Three-Dimensional Multicomputer Network Topology Using Through-Wafer Optics · IEEE Trans. Parallel Distributed Syst. 1998
Processor architecture and microarchitecture
chip multiprocessor
0.011997
High-Throughput, Low-Memory Applications on the Pica Architecture · IEEE Trans. Parallel Distributed Syst. 1997
Parallel and multicore computing › parallelization strategies
fine-grained parallelism
0.011997
High-Throughput, Low-Memory Applications on the Pica Architecture · IEEE Trans. Parallel Distributed Syst. 1997
Parallel and multicore computing › parallel architecture
message-passing architecture
0.011997
High-Throughput, Low-Memory Applications on the Pica Architecture · IEEE Trans. Parallel Distributed Syst. 1997
Performance modeling and evaluation › simulation › communication system simulation
network simulation
0.011998
The Offset Cube: A Three-Dimensional Multicomputer Network Topology Using Through-Wafer Optics · IEEE Trans. Parallel Distributed Syst. 1998
Interconnection networks and networks-on-chip
optical interconnection networks
0.011998
The Offset Cube: A Three-Dimensional Multicomputer Network Topology Using Through-Wafer Optics · IEEE Trans. Parallel Distributed Syst. 1998

Methods — techniques the papers use, named apart from their topics

virtual channels · 0.03d mesh embedding · 0.0instruction-level simulation · 0.0
YearPublicationVenuePosition
1998 The Offset Cube: A Three-Dimensional Multicomputer Network Topology Using Through-Wafer Optics
abstract
Three-dimensional packaging technologies are critical for enabling ultra-compact, massively parallel processors (MPPs) for embedded applications. Through-water optical interconnect has been proposed as a useful technology for building ultra-compact MPPs since it provides a simplified mechanism for interconnecting stacked multichip substrates. This paper presents the offset cube, a new network topology designed to exploit the packaging benefits of through-wafer optical interconnect in ultra-compact MPP systems. We validate the offset cube's topological efficiency by developing deadlock-free adaptive routing protocols with modest virtual channel requirements (only two virtual channels per link needed for full adaptivity). A preliminary analysis of router complexity suggests these protocols can be efficiently implemented in hardware. We also present a 3D mesh embedding for the offset cube. Network simulations show the offset cube performs comparably to a bidirectional 3D mesh of equal size under uniform, hot-spot, and trace-driven traffic loads. While the offset cube is not proposed as a general replacement for the mesh topology it leverages the benefits of through-wafer optical interconnect more effectively than a mesh by completely eliminating chip-to-chip wires for data signals. Hence, the offset cube is an effective topology for interconnecting ultra-compact MCM-level MPP systems.
W. Stephen Lacy, José Cruz-Rivera, D. Scott Wills
IEEE Trans. Parallel Distributed Syst.2
1997 High-Throughput, Low-Memory Applications on the Pica Architecture
abstract
This paper describes Pica, a fine-grain, message-passing architecture designed to efficiently support high-throughput, low-memory parallel applications, such as image processing, object recognition, and data compression. By specializing the processor and reducing local memory (4,096 36-bit words), multiple nodes can be implemented on a single chip. This allows high-performance systems for high-throughput applications to be realized at lower cost. The architecture minimizes overhead for basic parallel operations. An operand-addressed context cache and round-robin task manager support fast task swapping. Fixed-sized activation contexts simplify storage management. Word-tag synchronization bits provide low-cost synchronization. Several applications have been developed for this architecture, including thermal relaxation, matrix multiplication, JPEG image compression, and Positron Emission Tomography image reconstruction. These applications have been executed using an instrumented instruction-level simulator. The results of these experiments and an evaluation of Pica's architectural features are presented.
D. Scott Wills, Huy Cat, José Cruz-Rivera, W. Stephen Lacy, James M. Baker Jr., John Eble, Abelardo López-Lagunas, Michael A. Hopper
IEEE Trans. Parallel Distributed Syst.3
1996 Modeling the Technology Impact on the Design of a Two-Level Multicomputer Interconnection Network
abstract
The rapid advance of VLSI and packaging technologies has a significant impact on system architecture. In this paper, an analytical model is used to explore the design space of interconnection networks for a 4,096 node processing system incorporating multi-node chips packaged on a single MCM substrate. Possible designs are evaluated for a two-level interconnect with separate k-ary n-cube networks for intrachip and interchip communication. An analysis of the impact several architectural and technological parameters have on the optimal network implementation (based on average no-load latency) is presented.
José Cruz-Rivera, D. Scott Wills, Thomas K. Gaylord, Elias N. Glytsis
ICCD1
1995 Parallelized formulation of the maximum likelihood-expectation maximization algorithm for fine-grain message-passing architectures
abstract
Recent architectural and technological advances have led to the feasibility of a new class of massively parallel processing systems based on a fine-grain, message-passing computational model. These machines provide a new alternative for the development of fast, cost-efficient Maximum Likelihood-Expectation Maximization (ML-EM) algorithmic formulations. As an important first step in determining the potential performance benefits to be gathered from such formulations, we have developed an ML-EM algorithm suitable for the high-communications, low-memory (HCLM) execution model supported by this new class of machines. Evaluation of this algorithm indicates a normalized least-square error comparable to, or better than, that obtained via a sequential ray-driven ML-EM formulation and an effective speedup in execution time (as determined via discrete-event simulation of the Pica multiprocessor system currently under development at the Georgia Institute of Technology) of well over two orders of magnitude compared to current ray-driven sequential ML-EM formulations on high-end workstations. Thus, the HCLM algorithmic formulation may provide ML-EM reconstructions within clinical time-frames.
José Cruz-Rivera, Edward V. R. Di Bella, D. Scott Wills, Thomas K. Gaylord, Elias N. Glytsis
IEEE Trans. Medical Imaging1