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

C. Leung

dblp:45/6299 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1991
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1Software engineering, systems software and programming languages · 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 networks
1 paper
Physical-layer communications · 46% Wireless networking · 23% Transport protocols and congestion control · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 62% Processor architecture and microarchitecture · 19% Interconnection networks and networks-on-chip · 19%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.011991
An Adaptive Incremental Redundancy Selective-Repeat ARQ Scheme for Finite Buffer Receivers · INFOCOM 1991
Physical-layer communications › channel coding › hybrid ARQ
incremental redundancy
0.011991
An Adaptive Incremental Redundancy Selective-Repeat ARQ Scheme for Finite Buffer Receivers · INFOCOM 1991
Transport protocols and congestion control › error control › automatic repeat request
selective repeat ARQ
0.011991
An Adaptive Incremental Redundancy Selective-Repeat ARQ Scheme for Finite Buffer Receivers · INFOCOM 1991
Wireless networking
wireless network protocols
0.011991
An Adaptive Incremental Redundancy Selective-Repeat ARQ Scheme for Finite Buffer Receivers · INFOCOM 1991
Network performance modeling
throughput analysis
0.011991
An Adaptive Incremental Redundancy Selective-Repeat ARQ Scheme for Finite Buffer Receivers · INFOCOM 1991
Performance modeling and evaluation › simulation › simulation software
simulation infrastructure
0.011976
A Computer Simulation Facility for Packet Communication Architecture · ISCA 1976
Processor architecture and microarchitecture
dataflow architecture
0.011976
A Computer Simulation Facility for Packet Communication Architecture · ISCA 1976
Interconnection networks and networks-on-chip
packet communication
0.011976
A Computer Simulation Facility for Packet Communication Architecture · ISCA 1976

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

throughput comparison · 0.0punctured convolutional codes · 0.0microprocessor emulation · 0.0architecture description language · 0.0
YearPublicationVenuePosition
1991 An Adaptive Incremental Redundancy Selective-Repeat ARQ Scheme for Finite Buffer Receivers
abstract
An incremental redundancy selective-repeat ARQ (automatic-repeat-request) scheme, called the AIR (adaptive incremental redundancy) scheme, for use in systems with limited buffer receivers, based on the use of punctured convolutional codes, is introduced. Its throughput is compared to that of E. J. Weldon's (1982) scheme and a type-II ARQ scheme studied previously by the authors (1990). The AIR scheme is found to have a relatively good throughput over a wide range of channel conditions, thus making it attractive for use on time-varying channels.>
Samir Kallel, C. Leung
INFOCOM2
1976 A Computer Simulation Facility for Packet Communication Architecture
abstract
Several proposals for computer data processing and memory systems that exploit the inherent parallelism in programs expressed in data flow form have been advanced recently.These systems have packet communication architecture --each system consists of many units that interact only through the transmission of information packets through channels that link pairs of units.A simulation facility for evaluating the prograranability and potential performance of these proposed data processing and memory systems has been designed.The facility uses microprocessor modules to emulate the behavior of system units or groups of units.By conducting a simulation in accurate scale time a precise extrapolation of performance of a proposed system may be obtained.The user of the facility will specify the system to be simulated in an architecture description language.A host computer translates the system description modules into microprocessor programs and controls the loading and monitors the operation of the microprocessors.Application of the facility is illustrated by considerat:ion of a simple data flow processor.
C. Leung, David Misunas, A. Neczwid, Jack B. Dennis
ISCA1