Leandro Soares Indrusiak

Leandro Soares Indrusiak

Auto-generated profile, based on publicly available information

Leandro Soares Indrusiak

University of York, UK

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

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

Representative Publications

View All Publications
11 April 2017 in ACM Computing Surveys
Verified
Journal Article
Open access
Amit Kumar SinghAmit Kumar Singh
Amit Kumar Singh
PDPiotr Dziurzanski
Piotr Dziurzanski
HMHashan Roshantha Mendis
Hashan Roshantha Mendis
LILeandro Soares Indrusiak
Leandro Soares Indrusiak
Multi-/many-core systems are envisioned to satisfy the ever-increasing performance requirements of complex applications in various domains such as embedded and high-performance computing. Such systems need to cater to increasingly dynamic workloads, requiring efficient dynamic resource allocation strategies to satisfy hard or soft real-time constraints. This article provides an extensive survey of hard and soft real-time dynamic resource allocation strategies proposed since the mid-1990s and highlights the emerging trends for multi-/many-core systems. The survey covers a taxonomy of the resource allocation strategies and considers their various optimization objectives, which have been used to provide comprehensive comparison. The strategies employ various principles, such as market and biological concepts, to perform the optimizations. The trend followed by the resource allocation strategies, open research challenges, and likely emerging research directions have also been provided.


1 December 2014
Verified
Conference Paper
Closed access
ABA. Burns
A. Burns
JHJ. Harbin
J. Harbin
LIL.S. Indrusiak
L.S. Indrusiak
Lack of scalability and difficulties in predicting the temporal behaviour of bus-based architectures has lead to the development of Network-on-Chip (NoC) protocols that provide a schedulable resource for moving data across multi-core platforms. Wormhole switching and credit-based flow control protocols have been used to support flit-level priority-preemptive link arbitration in NoCs, which leads to analysable temporal behaviour. In this paper we develop a new protocol (WPMC), based on the same family of protocols, that gives full support to mixed-criticality on-chip communications. WPMC is defined to give adequate partitioning between criticality levels, and to use resources efficiently. Analysis is developed and implementation aspects are considered. A cycle accurate simulator is used for scenario-based verification, and the effectiveness of the protocol and its scheduling model is evaluated via message-set generation.

4 November 2015
Verified
Conference Paper
Open access
PDF file
SASebastian Altmeyer
Sebastian Altmeyer
RDRobert I. Davis
Robert I. Davis
LILeandro Indrusiak
Leandro Indrusiak
CMClaire Maiza
Claire Maiza
VNVincent Nelis
Vincent Nelis
JRJan Reineke
Jan Reineke
Outstanding paper awardInternational audienceIn this paper, we introduce a Multicore Response Time Analysis (MRTA) framework. This framework is extensible to different multicore architectures, with various types and arrangements of local memory, and different arbitration policies for the common interconnects. We instantiate the framework for single level local data and instruction memories (cache or scratchpads), for a variety of memory bus arbitration policies, including: Round-Robin, FIFO, Fixed-Priority, Processor-Priority, and TDMA, and account for DRAM refreshes. The MRTA framework provides a general approach to timing verification for multicore systems that is parametric in the hardware configuration and so can be used at the architectural design stage to compare the guaranteed levels of performance that can be obtained with different hardware configurations. The MRTA framework decouples response time analysis from a reliance on context independent WCET values. Instead, the analysis formulates response times directly from the demands on different hardware resources

16 September 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
GKGustavo Kunzel
Gustavo Kunzel
LILeandro Soares Indrusiak
Leandro Soares Indrusiak
CPCarlos Eduardo Pereira
Carlos Eduardo Pereira
Industrial Wireless Sensor Networks usually have a centralized management approach, where a device known as Network Manager is responsible for the overall configuration, definition of routes, and allocation of communication resources. Graph routing is used to increase the reliability of the communications through path redundancy. Some of the state-of-the-art graph routing algorithms use weighted cost equations to define preferences on how the routes are constructed. The characteristics and requirements of these networks complicate to find a proper set of weight values to enhance network performance. Reinforcement Learning can be useful to adjust these weights according to the current operating conditions of the network. We present the Q-Learning Reliable Routing with a Weighting Agent approach, where an agent adjusts the weights of a state-of-the-art graph routing algorithm. The states of the agent represent sets of weights, and the actions change the weights during network operation. Rewards are given to the agent when the average network latency decreases or the expected network lifetime increases. Simulations were conducted on a WirelessHART simulator considering industrial monitoring applications with random topologies. Results show, in most cases, a reduction of the average network latency while the expected network lifetime and the communication reliability are at least as good as what is obtained by the state-of-the-art graph routing algorithms.

18 July 2017 in Real-Time Systems
Verified
Journal Article
Open access
PDF file
RDRobert I. Davis
Robert I. Davis
SASebastian Altmeyer
Sebastian Altmeyer
LILeandro S. Indrusiak
Leandro S. Indrusiak
CMClaire Maiza
Claire Maiza
VNVincent Nelis
Vincent Nelis
JRJan Reineke
Jan Reineke
In this paper, we introduce a multicore response time analysis (MRTA) framework, which decouples response time analysis from a reliance on context-independent WCET values. Instead, the analysis formulates response times directly from the demands placed on different hardware resources. The MRTA framework is extensible to different multicore architectures, with a variety of arbitration policies for the common interconnects, and different types and arrangements of local memory. We instantiate the framework for single level local data and instruction memories (cache or scratchpads), for a variety of memory bus arbitration policies, including: Round-Robin, FIFO, Fixed-Priority, Processor-Priority, and TDMA, and account for DRAM refreshes. The MRTA framework provides a general approach to timing verification for multicore systems that is parametric in the hardware configuration and so can be used at the architectural design stage to compare the guaranteed levels of real-time performance that can be obtained with different hardware configurations. We use the framework in this way to evaluate the performance of multicore systems with a variety of different architectural components and policies. These results are then used to compose a predictable architecture, which is compared against a reference architecture designed for good average-case behaviour. This comparison shows that the predictable architecture has substantially better guaranteed real-time performance, with the precision of the analysis verified using cycle-accurate simulation.