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

Anup K. Ahluwalia

dblp:21/987 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · none

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

Systems, architecture and hardware · 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
1 paper
Performance modeling and evaluation · 93% Interconnection networks and networks-on-chip · 7%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › queueing models › markov chain model
discrete-time markov chain
0.011992
Performance Analysis of the Communication Architecture of the Connection Machine · IEEE Trans. Parallel Distributed Syst. 1992
Performance modeling and evaluation › delay analysis
message delay analysis
0.011992
Performance Analysis of the Communication Architecture of the Connection Machine · IEEE Trans. Parallel Distributed Syst. 1992
Performance modeling and evaluation › network performance analysis
network performance modeling
0.011992
Performance Analysis of the Communication Architecture of the Connection Machine · IEEE Trans. Parallel Distributed Syst. 1992
Performance modeling and evaluation
queueing models
0.011992
Performance Analysis of the Communication Architecture of the Connection Machine · IEEE Trans. Parallel Distributed Syst. 1992
Interconnection networks and networks-on-chip
interprocessor communication
0.011992
Performance Analysis of the Communication Architecture of the Connection Machine · IEEE Trans. Parallel Distributed Syst. 1992

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

simulation · 0.0fixed-point iteration · 0.0discrete-time markov chain · 0.0
YearPublicationVenuePosition
1992 Performance Analysis of the Communication Architecture of the Connection Machine
abstract
The performance of the interprocessor communication architecture of the CM-2 is analyzed. A discrete-time Markov chain model of its network architecture is developed to compute the message delay introduced by the network architecture. Due to the synchronous time-division multiplexing nature of the network operation, it is amenable to a discrete-time Markov chain modeling. The analysis yields formulas for response time and several other related performance measures, showing how the performance of the network degrades with the message arrival rate and other parameters. Since the communication delays affect interprocess communication, knowledge of the sensitivity of the delays to the parameters can be a useful aid in designing a high performance parallel system. To keep the analysis tractable, an approximate Markov model is used that requires the use of fixed-point iteration for its solution. Validation of the results against a simulation study reveals that the analysis predicts the performance of the network with high accuracy.>
Anup K. Ahluwalia, Mukesh Singhal
IEEE Trans. Parallel Distributed Syst.1