Jose Miguel Montanana Aliaga

Dr. Jose Miguel Montanana Aliaga

inpeek GmbH, Darmstadt, Hesse, Germany
orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 March 2008 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
OLOlav Lysne
Olav Lysne
JAJose Miguel Montanana Aliaga
Jose Miguel Montanana Aliaga
JFJose Flich
Jose Flich
JDJose Duato
Jose Duato
TPTimothy Mark Pinkston
Timothy Mark Pinkston
TSTor Skeie
Tor Skeie
Component failures and planned component replacements cause changes in the topology and routing paths supplied by the interconnection network of a parallel processor system over time. Such changes may require the network to be reconfigured such that the existing routing function is replaced by one that enables packets to reach their intended destinations amid the changes. Efficient reconfiguration methods are desired which allow the network to function uninterruptedly over the course of the reconfiguration process while remaining free from deadlocking behavior. In this paper, we propose, evaluate, and prove the deadlock freedom of a new network reconfiguration protocol that overlaps various phases of "static" reconfiguration processes traditionally used in commercial and research systems to provide performance efficiency on par with that of recently proposed "dynamic" reconfiguration processes but without their complexity. Simulation results show that the proposed Overlapping Static Reconfiguration protocol can reduce reconfiguration time by up to 50 percent, reduce packet latency by several orders of magnitude, reduce packet dropping by an order of magnitude, and provide unhalted packet injection as compared to traditional static reconfiguration while allowing network throughput similar to dynamic reconfiguration.

1 January 2004
Verified
Book Chapter
Closed access
PDF file
OLOlav Lysne
Olav Lysne
JAJose Miguel Montanana Aliaga
Jose Miguel Montanana Aliaga
TPTimothy Mark Pinkston
Timothy Mark Pinkston
JDJosé Duato
José Duato
TSTor Skeie
Tor Skeie
JFJosé Flich
José Flich

1 September 2009
Verified
Conference Paper
Closed access
JAJose Miguel Montanana Aliaga
Jose Miguel Montanana Aliaga
MKMichihiro Koibuchi
Michihiro Koibuchi
HMHiroki Matsutani
Hiroki Matsutani
HAHideharu Amano
Hideharu Amano
Current Network-on-Chip (NoC) architectures sometimes employ mesh or torus topology with the dimension-order routing. In this paper, we propose a deadlock-free routing algorithm, referred to as Balanced Dimension-Order Routing (BDOR), which provides the balanced minimal paths to each destination based on the simple routing regulations. Since the BDOR has the similar path regularity to that of the dimension-order routing, its implementation can be lightweight, and most of its modules can be borrowed from the router for the dimension-order routing. Evaluation results show that the BDOR router increases by 3.4% hardware amount compared with the router for the dimension-order routing. Also show that the throughput of the BDOR outperforms on average up to 14% that of the dimension-order routing on two-dimensional mesh and torus.

1 April 2008 in 2008 IEEE International Symposium on Parallel and Distributed Processing
Verified
Conference Paper
Closed access
JAJose Miguel Montanana Aliaga
Jose Miguel Montanana Aliaga
JFJ. Flich
J. Flich
JDJ. Duato
J. Duato
Dynamic network reconfiguration is defined as the process of changing from one routing function to another while the network remains up and running. The main challenge is to avoid deadlocks and reduce packet dropping rate while keeping network service. Current approaches either require the existence of extra network resources like e.g. virtual channels, their complexity is so high that their practical applicability is limited, or they affect to the performance of the network during the reconfiguration process. In this paper we present EBR, a simple and fast method for dynamic network reconfiguration. EBR guarantees a fast and deadlock-free reconfiguration, but instead of avoiding deadlocks our mechanism is based on regressive deadlock recoveries. Thus, EBR allows cycles to be formed, and in the situation of a deadlock some packets may be dropped. However, as demonstrated, no packets need to be dropped in the working zone of the system. Also, the mechanism works in an asynchronous manner, does not require additional resources and works on any topology. In order to minimize the number of dropped packets, EBR uses an epoch marking system that guarantees that only packets potentially leading to a deadlock will be removed. Evaluation results show that EBR works efficiently in different topologies and with different routing algorithms. When compared with current proposals, EBR always gets the best numbers in all the analyzed parameters (dropped packets, latency, throughput, reconfiguration time and resources required), thus achieving the good properties of all mechanisms.

10 June 2004
Verified
Conference Paper
Closed access
JAJose Miguel Montanana Aliaga
Jose Miguel Montanana Aliaga
JFJ. Flich
J. Flich
ARA. Robles
A. Robles
PLP. Lopez
P. Lopez
JDJ. Duato
J. Duato

1 March 2013
Verified
Conference Paper
Closed access
JAJose Miguel Montanana Aliaga
Jose Miguel Montanana Aliaga
DADavid de Andrés
David de Andrés
FTF. Tirado
F. Tirado
Multi-Processor Systems-on-Chip (MPSoCs) are increasingly popular in embedded systems, but also on high performance systems. In such systems, the data bandwidth requirements keeps increasing as the number of processing elements increases. Therefore, a Network-on-Chip (NoCs) communication architecture use to be preferred than a communication based on shared buses, because it provides higher communication performance. The probability of failure increases in this systems, due to these great advances in integration scales and the increasing number of components on chip. Therefore Fault Tolerance will become a key aspect on designing the near future VLSI SoC, and especially on their interconnection Network on Chip (NoC). This paper focuses on describe the particular aspects of NoCs, and the proposed fault-tolerant strategies for NoCs.