排序方式: 共有13条查询结果,搜索用时 281 毫秒
1.
Crespo Juan-José Sánchez José L. Alfaro-Cortés Francisco J. Flich José Duato José 《The Journal of supercomputing》2021,77(11):12826-12856
The Journal of Supercomputing - Deadlock-free dynamic network reconfiguration process is usually studied from the routing algorithm restrictions and resource reservation perspective. The dynamic... 相似文献
2.
Flich J. Lopez P. Malumbres M.P. Duato J. 《Parallel and Distributed Systems, IEEE Transactions on》2002,13(11):1166-1182
Networks of workstations (NOWs) are becoming increasingly popular as a cost-effective alternative to parallel computers. These networks allow the customer to connect processors using irregular topologies, providing the wiring flexibility, scalability, and incremental expansion capability required in this environment. Some of these networks use source routing and wormhole switching. In particular, we are interested in Myrinet networks because it is a well-known commercial product and its behavior can be controlled by the software running in network interfaces (Myrinet Control Program, MCP). Usually, the Myrinet network uses up*/down* routing for computing the paths for every source-destination pair. We propose the In-Transit Buffer (ITB) mechanism to improve network performance. We apply the ITB mechanism to NOWs with up*/down* source routing, like Myrinet, analyzing its behavior on both networks with regular and irregular topologies. The proposed scheme can be implemented on Myrinet networks by only modifying the MCP, without changing the network hardware. We evaluate by simulation several networks with different traffic patterns using timing parameters taken from the Myrinet network. Results show that the current routing schemes used in Myrinet networks can be strongly improved by applying the ITB mechanism. In general, our proposed scheme is able to double the network throughput on medium and large NOWs. Finally, we present a first implementation of the ITB mechanism on a Myrinet network. 相似文献
3.
Antoni Roca José Flich Federico Silla José DuatoAuthor vitae 《Microprocessors and Microsystems》2011,35(8):742-754
As technology advances, the number of cores in Chip MultiProcessor systems and MultiProcessor Systems-on-Chips keeps increasing. The network must provide sustained throughput and ultra-low latencies.In this paper we propose new pipelined switch designs focused in reducing the switch latency. We identify the switch components that limit the switch frequency: the arbiter. Then, we simplify the arbiter logic by using multiple smaller arbiters, but increasing greatly the switch area. To solve this problem, a second design is presented where the routing traversal and arbitrations tasks are mixed. Results demonstrate a switch latency reduction ranging from 10% to 21%. Network latency is reduced in a range from 11% to 15%. 相似文献
4.
R. Tornero J. M. Orduña A. Mejia J. Flich J. Duato 《International journal of parallel programming》2011,39(3):357-374
Networks on Chip (NoCs) have been shown as an efficient solution to the complex on-chip communication problems derived from
the increasing number of processor cores. One of the key issues in the design of NoCs is the reduction of both area and power
dissipation. As a result, two-dimensional meshes have become the preferred topology, since it offers low and constant link
delay. Unfortunately, manufacturing defects or even real-time failures often make the resulting topology to become irregular,
preventing the use of traditional routing algorithms. This scenario shows the need for topology-agnostic routing algorithms
that provide a valid routing solution when applied over any topology. This paper proposes a new communication-driven routing
technique that optimizes the network performance for Application-Specific NoCs. This technique combines a flexible, topology-agnostic
routing algorithm with a communication-aware mapping technique that matches the traffic generated by the application with
the available network bandwidth. Since the mapping technique can be pruned as needed in order to fit either quality function
values or time constraints, this technique can be adapted to fit with different computational costs. The evaluation results
show that it significantly improves network performance in terms of both latency and power consumption. 相似文献
5.
Martí nez Alejandro Garcí a Pedro J. Alfaro Francisco J. S nchez Jos L. Flich Jos Quiles Francisco J. Duato Jos 《Parallel and Distributed Systems, IEEE Transactions on》2009,20(1):13-24
Both QoS support and congestion management techniques become essential to achieve good network performance in current high-speed interconnection networks. The most effective techniques traditionally considered for both issues, however, require too many resources for being implemented. In this paper we propose a new cost-effective switch architecture able to face the challenges of congestion management and, at the same time, to provide QoS. The efficiency of our proposal is based on using the resources (queues) used by RECN (an efficient Head-Of-Line blocking elimination technique) also for QoS support, without increasing queue requirements. Provided results show that the new switch architecture is able to guarantee QoS levels without any degradation due to congestion situations. 相似文献
6.
J. Escudero‐Sahuquillo P. J. Garcia F. J. Quiles J. Flich J. Duato 《Concurrency and Computation》2011,23(17):2235-2248
The fat‐tree is one of the most common topologies among the interconnection networks of the systems currently used for high‐performance parallel computing. Among other advantages, fat‐trees allow the use of simple but very efficient routing schemes. One of them is a deterministic routing algorithm that has been recently proposed, offering a similar (or better) performance than adaptive routing while reducing complexity and guaranteeing in‐order packet delivery. However, as other deterministic routing proposals, this deterministic routing algorithm cannot react when high traffic loads or hot‐spot traffic scenarios produce severe contention for the use of network resources, leading to the appearance of Head‐of‐Line (HoL) blocking, which spoils the network performance. In that sense, we describe in this paper two simple, cost‐effective strategies for dealing with the HoL‐blocking problem that may appear in fat‐trees with the aforementioned deterministic routing algorithm. From the results presented in the paper, we conclude that, in the mentioned environment, these proposals considerably reduce HoL‐blocking without significantly increasing switch complexity and the required silicon area. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
7.
Interconnection networks are a key element in a wide variety of systems: massive parallel processors, local and system area networks, clusters of PCs and workstations, and Internet Protocol routers. They are essential to high performance in the form of high-bandwidth communications, with low latency, "quality of service" (guaranteed service levels), efficient switching, and flexibility of network topology, as embodied in Myrinet, InfiniBand, Quadrics, Advanced Switching, and similar interconnects. But, despite all the advances that modem interconnects offer, congestion is a growing problem as "lossless" interconnection networksrdquo those that do not allow data packets to be discarded" come to the fore. 相似文献
8.
Compared to the overdimensioned designs of the past, current interconnection networks operate closer to the point of saturation and run a higher risk of congestion. Among proposed strategies for congestion management, only the regional explicit congestion notification (RECN) mechanism achieves both the required efficiency and the scalability that emerging systems demand 相似文献
9.
Flich J. Lopez P. Malumbres M.P. Duato J. 《Parallel and Distributed Systems, IEEE Transactions on》2002,13(7):693-709
Networks of workstations (NOWs) are becoming increasingly popular as a cost-effective alternative to parallel computers. These networks allow the customer to connect processors using irregular topologies, providing the wiring flexibility, scalability and incremental expansion capability required in this environment. Some of these networks use source routing and wormhole switching. In particular, we are interested in Myrinet networks because they are a well-known commercial product and their behavior can be controlled by the software running on the network interfaces (the Myrinet Control Program, MCP). Usually, the Myrinet network uses up*/down* routing for computing the paths for every source-destination pair. In this paper, we propose an in-transit buffer (ITB) mechanism to improve the network performance. We apply the ITB mechanism to NOWs with up*/down* source routing, like the Myrinet, analyzing its behavior on networks with both regular and irregular topologies. The proposed scheme can be implemented on Myrinet networks by simply modifying the MCP, without changing the network hardware. We evaluate by simulation several networks with different traffic patterns using timing parameters taken from the Myrinet network. The results show that the current routing schemes used in Myrinet networks can be strongly improved by applying the ITB mechanism. In general, our proposed scheme is able to double the network throughput on medium and large NOWs. Finally, we present a first implementation of the ITB mechanism on a Myrinet network 相似文献
10.
Jesus Escudero-Sahuquillo Pedro J. Garcia Francisco J. Quiles Jose Flich Jose DuatoAuthor vitae 《Journal of Parallel and Distributed Computing》2011,71(11):1460-1472
High-speed interconnection networks are essential elements for different high-performance parallel-computing systems. One of the most common interconnection network topologies is the fat-tree, whose advantages have turned it into the favorite topology of many interconnect designers. One of these advantages is the possibility of using simple but efficient routing algorithms, like the recently proposed deterministic routing algorithm referred to as DET, which offers similar (or better) performance than Adaptive Routing while reducing complexity and guaranteeing in-order packet delivery. However, as other deterministic routing proposals, DET cannot react when packets intensely contend for network resources, leading to the appearance of Head-of-Line (HoL) blocking which spoils network performance. In this paper, we describe and evaluate a simple queue scheme that efficiently reduces HoL-blocking in fat-trees using the DET routing algorithm, without significantly increasing switch complexity and required silicon area. Additionally, we propose an implementation of OBQA in a feasible switch architecture. 相似文献