NoCo: ILP-based worst-case contention estimation for mesh real-time manycores

Manycores are capable of providing the computational demands required by functionally-advanced critical applications in domains such as automotive and avionics. In manycores a network-on-chip (NoC) provides access to shared caches and memories and hence concentrates most of the contention that tasks suffer, with effects on the worst-case contention delay (WCD) of packets and tasks' WCET. While several proposals minimize the impact of individual NoC parameters on WCD, e.g. mapping and routing, there are strong dependences among these NoC parameters. Hence, finding the optimal NoC configurations requires optimizing all parameters simultaneously, which represents a multidimensional optimization problem. In this paper we propose NoCo, a novel approach that combines ILP and stochastic optimization to find NoC configurations in terms of packet routing, application mapping, and arbitration weight allocation. Our results show that NoCo improves other techniques that optimize a subset of NoC parameters.This work has been partially supported by the Spanish Ministry of Economy and Competitiveness under grant TIN2015- 65316-P and the HiPEAC Network of Excellence. It also received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (agreement No. 772773). Carles Hernández is jointly supported by the MINECO and FEDER funds through grant TIN2014-60404-JIN. Jaume Abella has been partially supported by the Spanish Ministry of Economy and Competitiveness under Ramon y Cajal postdoctoral fellowship number RYC-2013-14717. Enrico Mezzetti has been partially supported by the Spanish Ministry of Economy and Competitiveness under Juan de la Cierva-Incorporaci´on postdoctoral fellowship number IJCI-2016-27396.Peer ReviewedPostprint (author's final draft

The Deadline Floor Protocol and Ada

At the 2013 IRTAW Workshop it was accepted that the Deadline Floor Protocol (DFP) has many advantaged over the Stack Resource Protocol (SRP), and that it should be incorporated into a future version of the language, and that ideally the support for SRP should be deprecated. This short position paper summarises the current status of proposed language changes that would be needed to make this happen. The context is single processor systems

Leveraging Ada 2012 and SPARK 2014 for assessing generated code from AADL models

Modeling of Distributed Real-time Embedded systems using Architecture Description Language provides the foundations for various levels of analysis: scheduling, reliability, consis- tency, etc.; but also allows for automatic code generation. A challenge is to demonstrate that generated code matches quality required for safety-critical systems. In the scope of the AADL, the Ocarina toolchain proposes code generation towards the Ada Ravenscar profile with restrictions for High- Integrity. It has been extensively used in the space domain as part of the TASTE project within the European Space Agency. In this paper, we illustrate how the combined use of Ada 2012 and SPARK 2014 significantly increases code quality and exhibits absence of run-time errors at both run-time and generated code levels

Integration Protocols for Voice and Data Traffic

Increasing demands for multimedia services offer integration of multimedia traffic as a hot issue in the future research areas. As a result, in the literature, many multiplexing schemes have been proposed. However, most of them have been implemented with a high complexity, others may be non-effective to satisfy the multiplexing performance criteria, while the rest are still not subjected to a wide range of analysis. Therefore, there is a critical need for comparing some of the recommended multiplexing schemes as well as developing a simple and effective integration protocol while still achieving reasonable bandwidth utilization. This thesis is intended to examine integration protocols for multimedia traffic, with primary focusing on voice-data integration. Firstly, a survey of the existing multiplexing schemes and related issues are presented. Next, an Adaptive Round Robin (ARR) protocol is proposed, as an alternative for voice-data integration, and extensively simulated. Finally, further comparisons, based on computer simulations, are carried out for various multiplexing schemes including Strictly Priority Servicing (SPS), Fixed Round Robin (FRR), Dynamic Bandwidth Allocation/(T1, T2) and Queue Length Threshold (QLT).As a contribution of the thesis, the proposed protocol tries to avoid the drawbacks of the previous multiplexing schemes besides satisfying the multiplexing performance criteria. The protocol differs from the others in that, it gives a limited priority for voice over data, it organizes the incoming packets to the single First-in First-out (FIFO) output buffer rather than the only outgoing scheduling, i.e., all data sources are polled in order according to the adaptation policy; however, before a data source can send a packet, all active voice sources are polled in order. Thus it provides an improvement in voice delay performance without significant effect on data delay performance over previous protocols. In addition, simulation comparisons between various multiplexing schemes have been discussed. In these simulations voice packets are assumed to be generated from on-off sources (talkspurt-silence calls), which is closer to reality and which is not considered in most of the performance analyses of previous schemes

Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks

The pervasiveness of the Internet and its applications lead to the potential increment of the users’ demands for more services with economical prices. The diversity of Internet traffic requires some classification and prioritisation since some traffic deserve much attention with less delay and loss compared to others. Current scheduling mechanisms are exposed to the trade-off between three major properties namely fairness, complexity and protection. Therefore, the question remains about how to improve the fairness and protection with less complex implementation. This research is designed to enhance scheduling mechanism by providing sustainability to the fairness and protection properties with simplicity in implementation; and hence higher service quality particularly for real-time applications. Extra elements are applied to the main fairness equation to improve the fairness property. This research adopts the restricted charge policy which imposes the protection of normal user. In terms of the complexity property, genetic algorithm has an advantage in holding the fitness score of the queue in separate storage space which potentially minimises the complexity of the algorithm. The integrity between conceptual, analytical and experimental approach verifies the efficiency of the proposed mechanism. The proposed mechanism is validated by using the emulation and the validation experiments involve real router flow data. The results of the evaluation showed fair bandwidth distribution similar to the popular Weighted Fair Queuing (WFQ) mechanism. Furthermore, better protection was exhibited in the results compared with the WFQ and two other scheduling mechanisms. The complexity of the proposed mechanism reached O(log(n)) which is considered as potentially low. Furthermore, this mechanism is limited to the wired networks and hence future works could improve the mechanism to be adopted in mobile ad-hoc networks or any other wireless networks. Moreover, more improvements could be applied to the proposed mechanism to enhance its deployment in the virtual circuits switching network such as the asynchronous transfer mode networks

Scheduling Techniques for Operating Systems for Medical and IoT Devices: A Review

Software and Hardware synthesis are the major subtasks in the implementation of hardware/software systems. Increasing trend is to build SoCs/NoC/Embedded System for Implantable Medical Devices (IMD) and Internet of Things (IoT) devices, which includes multiple Microprocessors and Signal Processors, allowing designing complex hardware and software systems, yet flexible with respect to the delivered performance and executed application. An important technique, which affect the macroscopic system implementation characteristics is the scheduling of hardware operations, program instructions and software processes. This paper presents a survey of the various scheduling strategies in process scheduling. Process Scheduling has to take into account the real-time constraints. Processes are characterized by their timing constraints, periodicity, precedence and data dependency, pre-emptivity, priority etc. The affect of these characteristics on scheduling decisions has been described in this paper

Implementasi Load Balancing Per address connection ECMP Algoritma Round Roubin Mikrotik Router

Internet access is a basic need that must be owned by both individuals and companies because of how important internet access is so that a company can work, in the current digital era, when internet access for a company or individual is experiencing problems, due to the ISP (Internet Service Provider). If the network is down or disconnected, it can be said that all activities will be inefficient, hampered, cannot open email, cannot connect to the central server, even entrepreneurs with orders via online cannot sell, for that when internet access becomes a vital object for companies, it is necessary an internet access or more than one ISP can use two or more ISPs where many methods are used to combine two or more internet accesses into one network that is connected by a local network but a very good method is used to maximize the two or more ISPs a is to use the Load Balancing method using the ECMP round roubin algorithm on the Mikrotik router device so it is hoped that internet access will continue even though one of the ISPs is down or network disturbances

Penyeimbangan Beban pada Sistem Berorientasi Service di Lingkungan Cloud dengan Menggunakan Algoritma Genetika dan Graf

Aplikasi-aplikasi enterprise yang dibangun dengan konsep Service Oriented Architecture (SOA) memiliki perbedaan dengan aplikasi-aplikasi native yang telah berkembang sebelumnya. SOA adalah model arsitektur yang fleksibel dan interoperable. Pembangunan aplikasi yang berbasis pada service adalah sangat cost effective, disamping memungkinkan untuk me-reuse service-service yang dihasilkan. Cloud computing merupakan suatu teknologi yang memanfaatkan internet sebagai resource untuk komputasi yang dapat di-request oleh pengguna dan merupakan sebuah layanan dengan pusat server bersifat virtual atau berada dalam cloud itu sendiri. SOA dengan dukungan teknologi cloud memberikan banyak keuntungan. Banyaknya jumlah pengguna yang me-request service yang berlokasi di cloud menghantarkan masalah klasik, yaitu pengalokasian request (workload) pada node tertentu untuk mencapai utilitas sistem yang tinggi. Penelitian ini berupaya menggabungkan konsep graf dengan algoritma genetika sebagai mekanisme load balancing pada sistem SOA di lingkungan Cloud

Real-Time Operating Systems and Programming Languages for Embedded Systems

In this chapter, we present the different alternatives that are available today for the development of real-time embedded systems. In particular, we will focus on the programming languages use like C++, Java and Ada and the operating systems like Linux-RT, FreeRTOS, TinyOS, etc. In particular we will analyze the actual state of the art for developing embedded systems under the WORA paradigm with standard Java [1], its Real-Time Specification and with the use of Real-Time Core Extensions and pico Java based CPUs [5]. We expect the reader to have a clear view of the opportunities present at the moment of starting a design with its pros and cons so it can choose the best one to fit its case.Fil: Orozco, Javier Dario. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones en Ingeniería Eléctrica "Alfredo Desages". Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras. Instituto de Investigaciones en Ingeniería Eléctrica "Alfredo Desages"; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras. Laboratorio de Sistemas Digitales; ArgentinaFil: Santos, Rodrigo Martin. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones en Ingeniería Eléctrica "Alfredo Desages". Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras. Instituto de Investigaciones en Ingeniería Eléctrica "Alfredo Desages"; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras. Laboratorio de Sistemas Digitales; Argentin