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

Joseph T. Rahmeh

dblp:88/29 · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

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

Systems, architecture and hardware · 11Software engineering, systems software and programming languages · 2

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
6 papers
Electronic design automation · 38% Hardware reliability and fault tolerance · 31% Processor architecture and microarchitecture · 22%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
logic simulation
0.011993
Evaluation of Parts by Mixed-Level DC-Connected Components in Logic Simulation · DAC 1993
Processor architecture and microarchitecture
branch prediction
0.011992
Improving the Accuracy of Dynamic Branch Prediction Using Branch Correlation · ASPLOS 1992
Hardware reliability and fault tolerance › software fault tolerance
algorithm-based fault tolerance
0.011990
Algorithm-Based Fault Tolerance on a Hypercube Multiprocessor · IEEE Trans. Computers 1990
Hardware reliability and fault tolerance › error detection
concurrent error detection
0.011990
Algorithm-Based Fault Tolerance on a Hypercube Multiprocessor · IEEE Trans. Computers 1990
Electronic design automation › design representation
behavioral modeling
0.011989
Automatic Generation of Behavioral Models from Switch-Level Descriptions · DAC 1989
Electronic design automation › hardware verification and test
fault simulation
0.011986
FAUST: An MOS Fault Simulator with Timing Information · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1986
Processor architecture and microarchitecture › arithmetic unit
arithmetic logic unit
0.011985
TIDBITS: Speedup Via Time-Delay Bit-Slicing in ALU Design for VLSI Technology · ISCA 1985
Integrated circuit design
digital circuit design
0.011985
TIDBITS: Speedup Via Time-Delay Bit-Slicing in ALU Design for VLSI Technology · ISCA 1985
Processor architecture and microarchitecture
instruction fetch
0.011992
Improving the Accuracy of Dynamic Branch Prediction Using Branch Correlation · ASPLOS 1992
Parallel and multicore computing › multiprocessor system › distributed-memory multiprocessor
hypercube multiprocessor
0.011990
Algorithm-Based Fault Tolerance on a Hypercube Multiprocessor · IEEE Trans. Computers 1990
Integrated circuit design
VLSI technology
0.011985
TIDBITS: Speedup Via Time-Delay Bit-Slicing in ALU Design for VLSI Technology · ISCA 1985

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

DC-connected component analysis · 0.0trace-driven simulation · 0.0hardware performance counters · 0.0finite-precision arithmetic analysis · 0.0static concurrent fault simulation · 0.0
YearPublicationVenuePosition
1993 Evaluation of Parts by Mixed-Level DC-Connected Components in Logic Simulation
abstract
Article Evaluation of parts by mixed-level DC-connected components in logic simulation Share on Authors: Dah-Cherng Yuan View Profile , Lawrence T. Pillage View Profile , Joseph T. Rahmeh View Profile Authors Info & Claims DAC '93: Proceedings of the 30th international Design Automation ConferenceJuly 1993 Pages 367–372https://doi.org/10.1145/157485.164934Online:01 July 1993Publication History 1citation129DownloadsMetricsTotal Citations1Total Downloads129Last 12 Months1Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Dah-Cherng Yuan, Lawrence T. Pileggi, Joseph T. Rahmeh
DAC3
1992 Improving the Accuracy of Dynamic Branch Prediction Using Branch Correlation
abstract
Long branch delay is a well-known problem in today's high performance superscalar and supetpipeline processor designs.A common technique used to alleviate this problem is to predict the direction of branches during the instruction fetch.Counter-based branch prediction, in particular, has been reported as an effective scheme for predicting the direction of branches.However, its accuracy is generally limited by branches whose future behavior is also dependent upon the history of other branches.To enhance branch prediction accuracy with a minimum increase in hardware COSLwe propose a correlation-based scheme and show how the prediction accuracy can be improved by incorporating information, not only from the history of a specific brsncb but also from the history of other branches.Specifically, we use the information provided by a proper subhistory of a branch to predict the outcome of that branch.The proper subhistory is selected based on the outcomes of the most recently executed M branches.The new scheme is evaluated using traces collected from running the SPEC benchmark suite on an IBM RISC System/6000 workstation.The results show that, as compared with the 2-bit counter-based prediction scheme, the correlation-based branch prediction achieves up to 11 ~0 additional accuracy at the extra hardware cost of one shift register.The results also show that the accuracy of the new scheme surpasses that of the counter-based branch predction at saturation.
Shien-Tai Pan, Kimming So, Joseph T. Rahmeh
ASPLOS3
1991 Interlock Schemes for Micropiplines: Application to a Self-Timed Rebound Sorter
abstract
Event controlled pipelines (micropipelines) have several advantages over clocked pipelines as they offer modularity and speed independence. The concept of micropipelines can be easily applied to any linear pipeline. In practice, most pipelines include feedback loops and, therefore, are not as easy to control as linear pipelines. A novel interlocking scheme to solve the control flow problem is proposed. As an application, the design of a self-timed rebound sorter is considered where interlocking schemes are required to ensure proper operation of the pipeline. Similar interlocking schemes can be used for other pipelines with feedback.>
Sankaran Karthik, Indira de Souza, Joseph T. Rahmeh, Jacob A. Abraham
ICCD3
1990 Fault grading of large digital systems
abstract
Cost-effective and accurate fault simulation of very large digital designs on engineering workstations is proposed. The hierarchical approach reduces memory requirements drastically by storing the structure of common repeated subcircuits only once. The approach allows flexible multilevel simulation. The simulation algorithms are at the switch-level so that general MOS digital designs with bidirectional signal flow can be handled, and both stuck-at and transistor faults are treated accurately. The fault simulation algorithms have been implemented as a prototype that was used to determine the fault grade of a model of the Motorola 68000 microprocessor on SUN Microsystems workstations.>
Daniel G. Saab, Robert B. Mueller-Thuns, David T. Blaauw, Joseph T. Rahmeh, Jacob A. Abraham
ICCD4
1990 Hierarchical multi-level fault simulation of large systems
Daniel G. Saab, Robert B. Mueller-Thuns, David T. Blaauw, Joseph T. Rahmeh, Jacob A. Abraham
J. Electron. Test.4
1990 Algorithm-Based Fault Tolerance on a Hypercube Multiprocessor
abstract
The design of fault-tolerant hypercube multiprocessor architecture is discussed. The authors propose the detection and location of faulty processors concurrently with the actual execution of parallel applications on the hypercube using a novel scheme of algorithm-based error detection. System-level error detection mechanisms have been implemented for three parallel applications on a 16-processor Intel iPSC hypercube multiprocessor: matrix multiplication, Gaussian elimination, and fast Fourier transform. Schemes for other applications are under development. Extensive studies have been done of error coverage of the system-level error detection schemes in the presence of finite-precision arithmetic, which affects the system-level encodings. Two reconfiguration schemes are proposed that allow the authors to isolate and replace faulty processors with spare processors.>
Prithviraj Banerjee, Joseph T. Rahmeh, Craig B. Stunkel, Suku Nair, Kaushik Roy 0001, Vijay Balasubramanian, Jacob A. Abraham
IEEE Trans. Computers2
1989 Automatic Generation of Behavioral Models from Switch-Level Descriptions
abstract
This paper discusses the automatic generation of high-level software models from switch-level circuit descriptions. The proposed algorithms operate directly on the hierarchical description, and incorporate information about the design such as the structure, regularity, functionality, and control signals in the generation process. New algorithms are proposed and have been implemented for combinational modules and bus structures. A significant speedup has been obtained for these modules of a commercially available chip.
David T. Blaauw, Daniel G. Saab, Robert B. Mueller-Thuns, Jacob A. Abraham, Joseph T. Rahmeh
DAC5
1989 Parallel-concurrent fault simulation
abstract
A fault simulation algorithm based on the partitioning of faults into groups, with the group size equal to the number of bits in the host computer word, is presented. The fault effects of a particular group are evaluated using parallel fault simulation techniques and propagated using concurrent fault simulation techniques. The speed of the algorithm depends on the circuit and on the fault-grouping criterion. Three static grouping criteria are examined and compared in terms of speed and memory requirements. A dynamic regrouping technique is developed and is shown to improve the performance of static grouping.>
Daniel G. Saab, Ibrahim N. Hajj, Joseph T. Rahmeh
ICCD3
1988 CHAMP: concurrent hierarchical and multilevel program for simulation of VLSI circuits
abstract
The design and implementation of a hierarchical switch-level simulator for complex digital circuits is discussed. The hierarchy is exploited to reduce the memory requirements of the simulation, thus allowing the simulation of circuits that are too large to simulate at the flat level. The algorithm used in the simulator operates directly on the hierarchical circuit description. Speedup is obtained through the use of high-level models. The simulator has been implemented on a SUN workstation and used to simulate a switch-level description of the Motorola 68000 microprocessor.>
Daniel G. Saab, Robert B. Mueller-Thuns, David T. Blaauw, Jacob A. Abraham, Joseph T. Rahmeh
ICCAD5
1986 FAUST: An MOS Fault Simulator with Timing Information
abstract
This paper describes FAUST, an MOS fault simulator with timing information. FAUST simulates the effects of realistic physical failures on MOS circuits and uses a static concurrent fault-simulation technique to evaluate the fault-free circuit and all the faulty circuits in one pass. FAUST produces voltage waveforms as well as logic tables with delay information for the fault-free circuit and for each of the faulty circuits.
Hsi-Ching Shih, Joseph T. Rahmeh, Jacob A. Abraham
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
1985 TIDBITS: Speedup Via Time-Delay Bit-Slicing in ALU Design for VLSI Technology
abstract
article TIDBITS: speedup via time-delay bit-slicing in ALU design for VLSI technology Share on Authors: Peter Y. T. Hsu Computer Systems Group, Coordinated Science Laboratory, University of Illinois at Urbana-Champalgn Computer Systems Group, Coordinated Science Laboratory, University of Illinois at Urbana-ChampalgnView Profile , Joseph T. Rahmeh Computer Systems Group, Coordinated Science Laboratory, University of Illinois at Urbana-Champalgn Computer Systems Group, Coordinated Science Laboratory, University of Illinois at Urbana-ChampalgnView Profile , Edward S. Davidson Computer Systems Group, Coordinated Science Laboratory, University of Illinois at Urbana-Champalgn Computer Systems Group, Coordinated Science Laboratory, University of Illinois at Urbana-ChampalgnView Profile , Jacob A. Abraham Computer Systems Group, Coordinated Science Laboratory, University of Illinois at Urbana-Champalgn Computer Systems Group, Coordinated Science Laboratory, University of Illinois at Urbana-ChampalgnView Profile Authors Info & Claims ACM SIGARCH Computer Architecture NewsVolume 13Issue 3June 1985 pp 29–35https://doi.org/10.1145/327070.327121Online:01 June 1985Publication History 5citation474DownloadsMetricsTotal Citations5Total Downloads474Last 12 Months6Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Peter Y.-T. Hsu, Joseph T. Rahmeh, Edward S. Davidson, Jacob A. Abraham
ISCA2