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

H. Madan

dblp:06/1592 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1988
—ORCID · none

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

Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1

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 · 59% Electronic design automation · 35% Distributed systems · 6%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › routing algorithms
adaptive routing
0.021988
Hyperswitch Network for the Hypercube Computer · ISCA 1988
A Real-Time Adaptive Message Routing Network for the Hypercube Computer · RTSS 1987
Interconnection networks and networks-on-chip
hypercube network
0.021988
Hyperswitch Network for the Hypercube Computer · ISCA 1988
A Real-Time Adaptive Message Routing Network for the Hypercube Computer · RTSS 1987
Electronic design automation › physical design
routing
0.011988
Hyperswitch Network for the Hypercube Computer · ISCA 1988
Electronic design automation › physical design › routing
message routing
0.011987
A Real-Time Adaptive Message Routing Network for the Hypercube Computer · RTSS 1987
Distributed systems
fault tolerance
0.011988
Hyperswitch Network for the Hypercube Computer · ISCA 1988

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

simulation · 0.0
YearPublicationVenuePosition
1988 A high-speed message-driven communication architecture
abstract
The performance of a message-passing multiple instruction multiple data (MIMD) concurrent computer depends in large part on the communication processing overhead. A high-speed communication architecture is proposed for a hypercube-type supercomputer to attain the specific goals of message-driven processing. These goals include: direct hardware execution of messages, queueing of messages (using various paradigms), adaptive message routing, and special local registers for fast context switching. A hyperswitch network capable of high-speed switching is used to perform message routing. Available communication paths are pruned by the routing algorithm in response to congestion within the network to evaluate the best-first available path between any two nodes. Simulation results show that this architecture reduces message reception latency by two to three orders of magnitude when compared to commercial hypercube systems. This communication architecture extends the application of parallel systems to supercomputer problems that place heavy demand on the communication network for high bandwidth, low latency, and non-local communication. Detailed simulation studies for the proposed communication architecture are presented.
John C. Peterson, E. T. Chow, H. Madan
ICS3
1988 Hyperswitch Network for the Hypercube Computer
abstract
A method is presented that realizes a kind of interconnection network, called a hyperswitch network, that is achieved using a mixture of static and dynamic topologies. Available of fault-free paths need not be specified by a source because the routing header can be modified in response to congestion or faults encountered as a path is established. This method can be accomplished in a static topology such as the hypercube network if the nodes have switching elements which are capable of dynamically performing the necessary routing header revisions. Detailed simulation results show that the hyperswitch network is consistently more efficient than fixed-path routing for large message traffic conditions. The simulation results also show that the hyperswitch network has equivalent latency overhead for messages with localized and antilocal destinations (i.e., less than a 25% difference between diameter 1 and 5).>
E. T. Chow, H. Madan, John C. Peterson, Dirk Grunwald, Daniel A. Reed
ISCA2
1987 A Real-Time Adaptive Message Routing Network for the Hypercube Computer
E. T. Chow, H. Madan, John C. Peterson
RTSS2