A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
pp-mess-sim: a flexible and extensible simulator for evaluating multicomputer networks
1997
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
, traffic patterns, and performance metrics with collections of packets, instead of the underlying router model. ...
The simulator models emerging multicomputer networks that can support multiple routing and switching schemes simultaneously; ppmess-sim achieves this flexibility by associating routing-switching policies ...
ACKNOWLEDGMENTS The work reported in this paper was supported in part by the U.S. National Science Foundation under Grant MIP-9203895. ...
doi:10.1109/71.569653
fatcat:u47by6qsbbhbnbfa2vs7xd5agy
Buffer management in wormhole-routed torus multicomputer networks
2000
Future generations computer systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As shown in Figure 1 .4, a multicomputer node mjnimally contains a microprocessor. local memory, and hardware support for int er-node corn-
Topology The topology of a network, usually modeled as a ...
of virtual channels one for upper class and mot her for lower class. ...
doi:10.1016/s0167-739x(99)00128-4
fatcat:6emrnixhcjhrvfhzskliadp5vm
Adaptive Virtual Cut-Through as a Viable Routing Method
1998
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Adaptive virtual cut-through is considered as a viable alternative to wormhole switching for fast and hardware-efficient interprocessor communication in multicomputers. ...
router chip. ...
The complete hardware implementation of the A ms algorithm in a multicomputer would involve using our router and NIC chips in the network interface. ...
doi:10.1006/jpdc.1998.1466
fatcat:kna74qb66fecvohloatq3xajue
Full-system simulation of distributed memory multicomputers
2009
Cluster Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper we discuss environments for the full-system simulation of multicomputers. ...
Furthermore we show some important details to have into account in order to do a valid full-system simulation of multicomputers, mostly related with synchronization and timing. ...
traffic that, while algorithmically generated, is inspired in actual applications [22] . ...
doi:10.1007/s10586-009-0086-y
fatcat:lj36fazkpjep5op6pywbpwgze4
A router architecture for flexible routing and switching in multihop point-to-point networks
1999
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In addition, a flexible router can support several applications or traffic types simultaneously, enabling better support of applications with multiple traffic classes. ...
In this paper, we identify a core set of architectural features necessary for flexible selection and implementation of multiple routing and switching schemes. ...
ACKNOWLEDGMENTS The work reported in this paper was supported in part by the U.S. National Science Foundation under grant MIP-9203895 and by the KOSEF under the postdoctoral fellowship. ...
doi:10.1109/71.744841
fatcat:dtrg2awoabhydnhqwjjezjvexa
ChaosLAN: Design and Implementation of a Gigabit LAN Using Chaotic Routing
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Although the Chaos router was developed for multicomputer routing, the project has recently directed its attention towards the application of Chaos technology to LAN switching. ...
Although the Chaos router was developed for multicomputer routing, the project has recently directed its attention towards the application of Chaos technology to LAN switching. ...
Acknowledgments We appreciate the contribution of UW undergraduate students Ville Aikas, Jason Murray and Kevin Taylor to the development of ChaosLAN. ...
doi:10.1007/3-540-69352-1_21
fatcat:ja42iby2ora2dlcm5l6qskttfy
Wormhole routing techniques for directly connected multicomputer systems
1998
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The routing algorithms are implemented in the router chips. We outline the router characteristics and describe the functionality of various elements of the router. ...
We discuss several representative algorithms for all these categories. The algorithms within each category vary in terms of resource requirements and performance under various traffic conditions. ...
ACKNOWLEDGMENTS The author is grateful to Jatin Upadhyay and Vara Varavithya for their help in preparing this article: the comments and suggestions by Professor Lionel Ni have also improved its quality ...
doi:10.1145/292469.292472
fatcat:awgtqfbqvjfmvfibgxf3aeqlay
Deadlock-free adaptive routing in multicomputer networks using virtual channels
1993
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For nonuniform traffic patterns, these algorithms improve network throughput by a factor of three compared to deterministic routing. ...
Abstmct-The use of adaptive routing in a multicomputer interconnection network improves network performance by making use of all available paths and provides fault tolerance by allowing messages to be ...
Aoki thanks his wife Kuniko for her support during this work. ...
doi:10.1109/71.219761
fatcat:ppbyz5gbqvh2pdgb2vsbrmxvyq
A framework for designing deadlock-free wormhole routing algorithms
1996
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
on the last two classes of networks. ...
The hop-based wormhole algorithms can be applied to a variety of networks including torus, mesh, de Brujin, and a class of Cayley networks, with the best known bounds on virtual channels for minimal routing ...
Chalsani's research has been supported in part by a grant from the graduate school of the University of Wisconsin-Madison, and by NSF Grants CCR-9308966 and ECS-9216308. ...
doi:10.1109/71.485506
fatcat:hedproogcrhizm6cmhh3zdq4oa
A framework for adaptive routing in multicomputer networks
1991
SIGARCH Computer Architecture News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Vl In addition to the potential gam m network performance, the adaptive approach offers the potential for exploiting the inherent path redundancy found in richly connected networks in order to perform ...
The network performance of this highly evolved oblivious technique has reached a limit of being capable of delivering, under random traffic, a stable maximum sustained throughput of~ 45 to 50% of the limit ...
Since, in that case, the queues for normal network traffic and for arrival messages are both competing for the finite number of buffer at each router. ...
doi:10.1145/121956.121957
fatcat:ffsmnhjqizautb2rini3orlq5i
Improving the performance of large interconnection networks using congestion-control mechanisms
2008
Performance evaluation (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
A representative router would provide minimal adaptive routing 2 , to support multiple workloads, and use avoidance or recovery mechanisms to deal with network deadlocks. ...
Although congestion is a common problem in all types of networks, up to now it has not been a critical issue in interconnection network design. The reasons for this are multiple. ...
LBR and GBR fall in this category. • Priority-based. Higher priority is given to a certain class of packets, for example, those in transit (vs. those waiting to be injected). ...
doi:10.1016/j.peva.2007.05.001
fatcat:43gz653gzvfzrecghddhkv6gbu
AN ASSESSMENT OF THE CONNECTION MACHINE
1993
International journal of high speed computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These are contrasted with the same issues in MD multiprocessors and multicomputers. ...
Then important issues in the architecture and programming environment of connection machines in general are considered. ...
In both classes of machine, hardware costs are roughly the same, with slightly less hardware devoted to interconnect in the multicomputers. In early multicomputers, memory per node was inadequate. ...
doi:10.1142/s0129053393000220
fatcat:simo6to2hnamhec4itephqirvm
A Predictable Communication Scheme for Embedded Multiprocessor Systems
2006
2006 IFIP International Conference on Very Large Scale Integration
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A dynamic allocation is more suitable for flexible multiprocessor systems and requires the implementation of a Quality-of-Service (QoS) mechanism. ...
The simulation results show that the connectionless scheme provides a better predictability in terms of message latency with an acceptable buffer requirement. ...
For the purpose of the current work, the last technique, synthetic workload generation, is adopted in order to have a range of traffic profiles for different classes of traffic. ...
doi:10.1109/vlsisoc.2006.313225
dblp:conf/vlsi/HarmanciPIL06
fatcat:alpas2gl4jgm3c5vdx7akcklya
Fault-tolerant communication with partitioned dimension-order routers
1999
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose methods to handle faults in multicomputers with dimension-order routers with simple changes to router structure and logic. ...
implementation of routers. ...
This work was performed while Suresh Chalasani was with the Department of Electrical and Computer Engineering at the University of Wisconsin-Madison. ...
doi:10.1109/71.808144
fatcat:bajmiqhazjd4zabersidjsr7rm
Efficient Multicast Algorithms for Mesh and Torus Networks
2014
2014 IEEE International Symposium on Parallel and Distributed Processing with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Efficient Multicast Algorithms for Mesh and Torus Networks Ankit Malani With the increasing popularity of multicomputers, efficient way of communication within its processors has become a popular area ...
Multicomputers refer to a computer system that has multiple processors, they have high computational power and they can perform multiple tasks concurrently. ...
Hardware support is essential for the transmission of messages between nodes. A router is responsible to handle all the communication related tasks. ...
doi:10.1109/ispa.2014.39
dblp:conf/ispa/HarutyunyanM14
fatcat:3fmuoxzmlbhcpkdvyxqnzmgpwy
« Previous
Showing results 1 — 15 out of 122 results