text:
@inproceedings{Zhu2004,
abstract = {For mission critical real-time applications, such as satellite and surveillance systems, a high level of reliability is desired as well as low energy consumption. In this paper, we propose a general system power model and explore the optimal speed setting to minimize system energy consumption for an Optimistic TMR (OTMR) scheme. The performance of OTMR is compared with that of TMR and Duplex with respect to energy and reliability. The results show that OTMR is always better than TMR by achieving higher levels of reliability and consuming less energy. With checkpoint overhead and recovery, Duplex is not applicable when system load is high. However, Duplex may be more energy efficient than OTMR depending on system static power and checkpointing overhead. Moreover, with one recovery section, Duplex achieves comparable levels of reliability as that of OTMR.},
author = {Zhu, Dakai and Melhem, Rami and Moss{\'{e}}, Daniel and Elnozahy, Elmootazbellah},
booktitle = {Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS},
doi = {10.1109/icpads.2004.1316138},
pages = {559--568},
title = {{Analysis of an energy efficient optimistic TMR scheme}},
volume = {10},
year = {2004}
}
@inproceedings{Ranjbar2019,
author = {Ranjbar, Behnaz and Nguyen, Tuan D. A. and Ejlali, Alireza and Kumar, Akash},
booktitle = {2019 22nd Euromicro Conference on Digital System Design (DSD)},
doi = {10.1109/DSD.2019.00084},
isbn = {978-1-7281-2862-7},
month = {aug},
pages = {546--553},
publisher = {IEEE},
title = {{Online Peak Power and Maximum Temperature Management in Multi-core Mixed-Criticality Embedded Systems}},
url = {https://ieeexplore.ieee.org/document/8875200/},
year = {2019}
}
@inproceedings{Medina2018,
abstract = {In the critical systems domain, Mixed Criticality Systems (MCS) improve considerably the usage of computation resources by running tasks with different levels of criticality on multi-core processors. To ensure the safety of MCS, services provided by low criticality tasks are degraded or stopped whenever high criticality tasks need more computation time than initially credited. The evaluation of this degradation is hardly considered in the literature although low criticality services are of prime importance for the quality of service (QoS) of critical systems. In this paper, we propose a method to evaluate the availability of low criticality services, i.e. how often these services are delivered in MCS. We also propose a task model that improves this availability, demonstrated thanks to our evaluation method on an illustrative example of MCS.},
author = {Medina, Roberto and Borde, Etienne and Pautet, Laurent},
booktitle = {Proceedings of the 2018 Design, Automation and Test in Europe Conference and Exhibition, DATE 2018},
doi = {10.23919/DATE.2018.8342210},
isbn = {9783981926316},
month = {apr},
pages = {1271--1276},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
title = {{Availability enhancement and analysis for mixed-criticality systems on multi-core}},
volume = {2018-Janua},
year = {2018}
}
@article{Ansari2019,
author = {Ansari, Mohsen and Saberlatibari, Javad and Pasandideh, Seyed Mostafa and Ejlali, Alireza},
doi = {10.1109/tpds.2019.2940631},
issn = {1045-9219},
journal = {IEEE Transactions on Parallel and Distributed Systems},
month = {sep},
pages = {1--1},
publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
title = {{Simultaneous Management of Peak-Power and Reliability in Heterogeneous Multicore Embedded Systems}},
year = {2019}
}
@article{Ansari2019a,
author = {Ansari, Mohsen and Pasandideh, Mostafa and Saber-Latibari, Javad and Ejlali, Alireza},
doi = {10.1109/les.2019.2931882},
issn = {1943-0663},
journal = {IEEE Embedded Systems Letters},
month = {jul},
pages = {1--1},
publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
title = {{Meeting Thermal Safe Power in Fault-Tolerant Heterogeneous Embedded Systems}},
year = {2019}
}
@article{Ansari2019b,
author = {Ansari, Mohsen and Yeganeh-Khaksar, Amir and Safari, Sepideh and Ejlali, Alireza},
doi = {10.1109/tcad.2019.2901244},
issn = {0278-0070},
journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
month = {feb},
pages = {1--1},
publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
title = {{Peak-Power-Aware Energy Management for Periodic Real-Time Applications}},
year = {2019}
}
@article{Pagani2015,
abstract = {Energy efficiency is an important issue in computing systems and operating within a safe power budget is a necessary constraint. This paper presents a simple and practical solution both for energy minimization and peak power reduction, called Single Voltage Approximation (SVA) scheme, for periodic real-time tasks on multicore systems with a shared supply voltage in a voltage island. SVA is inspired by the Single Frequency Approximation (SFA) scheme, in which all the cores in the island run at a single voltage and frequency such that all tasks can meet their deadlines. In SVA, all the cores in the island are also executed at the same single voltage as in SFA. However, the frequency of each core is individually chosen, such that the tasks in each core can meet their deadlines, but without running at unnecessarily high frequencies. Thus, all the cores are executing tasks all the time and there is no need for any Dynamic Power Management (DPM) technique for reducing the energy consumption for idling. For task partitioning, SVA is combined with the Double Largest Task First (DLTF) partitioning scheme. Most importantly, this paper provides comprehensive analysis for combining DLTF and SVA, deriving its worst-case behavior both for energy minimization and peak power reduction, compared against the optimal solutions. Our analysis shows that, depending on the hardware, the energy consumption by combining DLTF and SVA is at most 1.95 (2.21, 2.42, and 2.59, respectively), compared to the optimal solutions, when the voltage island has up to 4 (8, 16, and 32, respectively) cores, which outperforms the worst-case factors of SFA when the cores fail to sleep efficiently. For peak power reduction, due to running at slower frequencies, combining DLTF and SVA always outperforms SFA, both in average and corner cases. Finally, we extend our analysis considering multicore systems with discrete voltage and frequency pairs and multiple voltage islands.},
author = {Pagani, Santiago and Chen, Jian Jia and Henkel, Jorg},
doi = {10.1109/TCAD.2015.2406862},
issn = {02780070},
journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
keywords = {Energy Efficiency,Multiple Voltage Islands,Peak Power,Power Management,Single Frequency Approximation (SFA),Single Voltage Approximation (SVA),Task Partitioning},
month = {sep},
number = {9},
pages = {1415--1428},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
title = {{Energy and Peak Power Efficiency Analysis for the Single Voltage Approximation (SVA) Scheme}},
volume = {34},
year = {2015}
}
@inproceedings{Lee2010,
abstract = {In this paper, we propose the task scheduling for preventing the occurrence of peak power in the multi-core systems considering data dependence. In the mobile system, the peak power reduces the battery lifetime and makes the system unstable. Among the power consumption of system, the proportion of power consumption of core is very large. If cores execute multiple tasks simultaneously, this gives rise to the peak power. Therefore, algorithm to minimize the occurrence of peak power is needed. When multiple tasks are allocated to the multi-core systems, data dependence relations of all tasks should be considered to avoid data interferences. The proposed algorithm to reduce the peak power schedules the tasks with the data dependence information after data dependence analysis. The proposed algorithm is composed of task partitioning step, data dependence analysis step and priority scheduling step. The simulation results show that the proposed algorithm reduce the occurrence of peak power by up to around 11{\%} compared to the existing algorithms. {\textcopyright}2010 IEEE.},
author = {Lee, Bong Ki and Kim, Jaehwan and Jeung, Yeuncheul and Chong, Jongwha},
booktitle = {2010 International SoC Design Conference, ISOCC 2010},
doi = {10.1109/SOCDC.2010.5682930},
isbn = {9781424486335},
keywords = {Data dependence,Multi-core,Peak power,Task scheduling},
pages = {233--235},
title = {{Peak power reduction methodology for multi-core systems}},
url = {https://ieeexplore.ieee.org/abstract/document/5682930/},
year = {2010}
}
@article{Lee2014,
abstract = {The potential of multi-core chips for high performance and reliability at low cost has made them ideal computing platforms for embedded real-time systems. As a result, power management of a multi-core chip has become an important issue in the design of embedded real-time systems. Most existing approaches have been designed to regulate the behavior of average power consumption, such as minimizing the total energy consumption or the chip temperature. However, little attention has been paid to the worst-case behavior of instantaneous power consumption on a chip, called chip-level peak power consumption , an important design parameter that determines the cost and/or size of chip design/packaging and the underlying power supply. We address this problem by reducing the chip-level peak power consumption at design time without violating any real-time constraints. We achieve this by carefully scheduling real-time tasks, without relying on any additional hardware implementation for power management, such as dynamic voltage and frequency scaling. Specifically, we propose a new scheduling algorithm FP$\Theta$ that restricts the concurrent execution of tasks assigned on different cores, and perform its schedulability analysis. Using this analysis, we develop a method that finds a set of concurrent executable tasks, such that the design-time chip-level peak power consumption is minimized and all timing requirements are met. We demonstrate via simulation that the proposed method not only keeps the design-time chip-level peak power consumption as low as the theoretical lower bound for trivial cases, but also reduces the peak power consumption for non-trivial cases by up to {\$}12.9{\$} percent compared to the case of no restriction on concurrent task execution. {\textcopyright} 1990-2012 IEEE.},
author = {Lee, Jinkyu and Yun, Buyoung and Shin, Kang G.},
doi = {10.1109/TPDS.2013.131},
issn = {10459219},
journal = {IEEE Transactions on Parallel and Distributed Systems},
keywords = {Peak power consumption,multi-core systems,real-time scheduling,system design},
number = {4},
pages = {1024--1033},
title = {{Reducing peak power consumption inmulti-core systems without violating real-time constraints}},
url = {https://ieeexplore.ieee.org/abstract/document/6514878/},
volume = {25},
year = {2014}
}
@inproceedings{Munawar2014,
abstract = {The number and diversity of cores in on-chip systems is increasing rapidly. However, due to the Thermal Design Power (TDP) constraint, it is not possible to continuously operate all cores at the same time. Exceeding the TDP constraint may activate the Dynamic Thermal Management (DTM) to ensure thermal stability. Such hardware based closed-loop safeguards pose a big challenge in using many-core chips for real-time tasks. Managing the worst-case peak power usage of a chip can help toward resolving this issue. We present a scheme to minimize the peak power usage for frame-based and periodic real-time tasks on many-core processors by scheduling the sleep cycles for each active core and introduce the concept of a sufficient test for peak power consumption for task feasibility. We consider both inter-task and inter-core diversity in terms of power usage and present computationally efficient algorithms for peak power minimization for these cases, i.e., a special case of 'homogeneous tasks on homogeneous cores' to the general case of 'heterogeneous tasks on heterogeneous cores'. We evaluate our solution through extensive simulations using the 48-core SCC platform and gem5 architecture simulator. Our simulation results show the efficacy of our scheme.},
author = {Munawar, Waqaas and Khdr, Heba and Pagani, Santiago and Shafique, Muhammad and Chen, Jian Jia and Henkel, Jorg},
booktitle = {Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS},
doi = {10.1109/PADSW.2014.7097809},
isbn = {9781479976157},
issn = {15219097},
keywords = {Peak power managment,Real-time,many-core},
pages = {200--209},
title = {{Peak Power Management for scheduling real-time tasks on heterogeneous many-core systems}},
url = {https://ieeexplore.ieee.org/abstract/document/7097809/},
volume = {2015-April},
year = {2014}
}
@inproceedings{Al-Bayati2016,
abstract = {Mixed-criticality systems (MCS) integrate components from different levels of criticality onto the same platform. MCS, like all other electronic systems, are susceptible to transient faults. These systems must mitigate the effects of faults and provide recovery mechanisms when faults occur. In this paper, we consider the problem of designing and scheduling certifiable fault-tolerant mixed-criticality systems. To address certification and transient faults, two-mode models must treat any single overrun or fault as a combination of the two, reserving time for the re-execution of tasks with extended execution time. We therefore propose a new four-mode model that addresses fault and execution time overrun with separate modes. This model, combined with the selective continuation of low-criticality tasks, improves the quality of service (QoS) to these tasks while providing the same guarantee to high-criticality tasks. Experimental results show that QoS improvements of up to 42.9{\%} can be achieved by the new model. Furthermore, we show how the model and its schedulability analysis can be calibrated to realistic failures rates to achieve even more efficient designs.},
author = {Al-Bayati, Zaid and Caplan, Jonah and Meyer, Brett H and Zeng, Haibo},
booktitle = {2016 Design, Automation {\&} Test in Europe Conference {\&} Exhibition (DATE)},
address = {Dresden, Germany},
file = {:C$\backslash$:/Users/PC Khafan/AppData/Local/Mendeley Ltd./Mendeley Desktop/Downloaded/Al-Bayati et al. - 2016 - A Four-Mode Model for Efficient Fault-Tolerant Mixed-Criticality Systems.pdf:pdf},
isbn = {9783981537062},
publisher = {IEEE},
title = {{A Four-Mode Model for Efficient Fault-Tolerant Mixed-Criticality Systems}},
year = {2016}
}
@article{Caplan2018,
abstract = {Embedded systems in several domains such as avionics and automotive are subject to inspection from certification authorities. These authorities are interested in verifying the safety-critical aspects of a system and, typically, do not certify non-critical parts. The design of such Mixed-Criticality Systems (MCS) has received increasing attention in recent years. However, although MCS must be designed to overcome transient faults, their susceptibility to transient faults is often overlooked. In this paper, we consider the problem of mapping and scheduling efficient, certifiable MCS that can survive transient faults. We generalize previous MCS models and analysis to support On-Demand Redundancy (ODR). A task set transformation is proposed to generate a modified task set that supports various forms of ODR while satisfying reliability and certification requirements. The analysis is incorporated into a design space exploration algorithm that supports a wide range of fault-Tolerance mechanisms and heterogeneous platforms. Experiments show that ODR can improve Quality of Service (QoS) provided to non-critical tasks by 29 percent on average, compared to lockstep execution. Moreover, combining several fault-Tolerance mechanisms can lead to additional improvements in schedulability and QoS.},
author = {Caplan, Jonah and Al-Bayati, Zaid and Zeng, Haibo and Meyer, Brett H.},
doi = {10.1109/TC.2017.2762293},
issn = {00189340},
journal = {IEEE Transactions on Computers},
keywords = {Mixed-criticality systems,design space exploration,on-demand redundancy,scheduling,transient faults},
number = {4},
pages = {582--588},
title = {{Mapping and Scheduling Mixed-Criticality Systems with On-Demand Redundancy}},
url = {https://ieeexplore.ieee.org/abstract/document/8066347/},
volume = {67},
year = {2018}
}
@inproceedings{Thekkilakattil2015,
abstract = {Adopting mixed-criticality architectures enable safe sharing of computational resources between tasks of different criticalities consequently leading to reduced Size, Weight and Power (SWaP) requirements. A majority of the research in mixed-criticality systems focuses on scheduling tasks whose Worst Case Execution Times (WCETs) are certified to varying levels of assurances. If any given task overruns its WCET, the system switches to a higher criticality and all the lower criticality tasks are discarded to make time for the execution of higher criticality tasks. Task execution time overruns are transient faults that are typically tolerated by simply executing an alternate task before the original deadline, or, by discarding the failed task to prevent it from interfering with higher criticality tasks. However, permanent faults such as processor failures can render the system to be useless, many times leading to unsafe states. In this paper we present a taxonomy of fault tolerance techniques to tolerate permanent faults, as well as map it to real-time mixed-criticality requirements based on the extend of fault coverage that in turn influences the associated assurance.},
author = {Thekkilakattil, Abhilash and Burns, Alan and Dobrin, Radu and Punnekkat, Sasikumar},
booktitle = {The 3rd International Workshop on Mixed Criticality Systems},
file = {:C$\backslash$:/Users/PC Khafan/AppData/Local/Mendeley Ltd./Mendeley Desktop/Downloaded/Thekkilakattil et al. - Unknown - Mixed Criticality Systems Beyond Transient Faults.pdf:pdf},
pages = {22--27},
title = {{Mixed Criticality Systems : Beyond Transient Faults}},
url = {https://www-users.cs.york.ac.uk/{~}robdavis/wmc/WMC2015proceedings.pdf},
year = {2015}
}
@article{Lin2015,
abstract = {Enabling computer tasks with different levels of criticality running on a common hardware platform has been an increasingly important trend in the design of real-time and embedded systems. On such systems, a real-time task may exhibit different WCETs (Worst Case Execution Times) in different criticality modes. It is well-known that traditional real-time scheduling methods are not applicable to ensure the timely requirement of the mixed-criticality tasks. In this paper, the authors study a problem of scheduling real-time, mixed-criticality tasks with fault tolerance. An optimal, off-line algorithm is designed to guarantee the most tasks completing successfully when the system runs into the high-criticality mode. A formal proof of the optimality is given. Also, a novel on-line slack-reclaiming algorithm is proposed to recover from computing faults before the tasks' deadline during the run-time. Simulations show that an improvement of about 30{\%} in performance is obtained by using the slack-reclaiming method.},
author = {Lin, Jian Denny and Cheng, Albert M.K. and Steel, Doug and Wu, Michael Yu Chi and Sun, Nanfei},
doi = {10.4018/IJERTCS.2015040104},
file = {:C$\backslash$:/Users/PC Khafan/AppData/Local/Mendeley Ltd./Mendeley Desktop/Downloaded/Lin et al. - Unknown - Scheduling Mixed-Criticality Real-Time Tasks in a Fault-Tolerant System.pdf:pdf},
issn = {19473184},
journal = {International Journal of Embedded and Real-Time Communication Systems},
keywords = {Cyber-Physical Systems,Fault-Tolerance,Mixed-Criticality,Real-Time Scheduling,Real-Time Systems},
number = {2},
pages = {65--86},
title = {{Scheduling mixed-criticality real-time tasks in a fault-tolerant system}},
url = {www.igi-global.com/chapter/adaptation-of-winlink-2000-emergency-amateur-},
volume = {6},
year = {2015}
}
@inproceedings{Medina2018a,
author = {Medina, Roberto and Borde, Etienne and Pautet, Laurent},
booktitle = {2018 IEEE Real-Time Systems Symposium (RTSS)},
doi = {10.1109/RTSS.2018.00042},
isbn = {978-1-5386-7908-1},
month = {dec},
pages = {254--264},
publisher = {IEEE},
title = {{Scheduling Multi-periodic Mixed-Criticality DAGs on Multi-core Architectures}},
url = {https://ieeexplore.ieee.org/document/8603218/},
year = {2018}
}
@inproceedings{Medina2017,
abstract = {Deploying safety-critical systems into constrained embedded platforms is a challenge for developers who must arbitrate between two conflicting objectives: software has to be safe and resources need to be used efficiently. Mixed-criticality (MC) has been proposed to meet a trade-off between these two aspects. Nonetheless, most task models considered in the literature of MC scheduling, do not take into account precedence constraints among tasks. In this paper, we propose a multicore scheduling approach for a model presenting MC tasks and their dependencies as a Directed Acyclic Graph (DAG). We also introduce an evaluation framework for this model, released as an open source software. Evaluation of our scheduling algorithm provides evidence of the difficulty to find correct scheduling for DAGs of MC tasks. Besides, experimentation results provided in this paper show that our scheduling algorithm outperforms existing algorithms for scheduling DAGs of MC tasks.},
author = {Medina, Roberto and Borde, Etienne and Pautet, Laurent},
booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
doi = {10.1007/978-3-319-60588-3_14},
isbn = {9783319605876},
issn = {16113349},
keywords = {Directed acyclic graphs,Mixed-criticality,Mode transition,Real-time scheduling},
pages = {217--232},
publisher = {Springer, Cham},
title = {{Directed acyclic graph scheduling for mixed-criticality systems}},
url = {http://link.springer.com/10.1007/978-3-319-60588-3{\_}14},
volume = {10300 LNCS},
year = {2017}
}
@inproceedings{Yang2019,
author = {Yang, Tao and Tang, Yue and Jiang, Xu and Deng, Qingxu and Guan, Nan},
booktitle = {2019 IEEE 22nd International Symposium on Real-Time Distributed Computing (ISORC)},
doi = {10.1109/ISORC.2019.00039},
isbn = {978-1-7281-0151-4},
month = {may},
pages = {163--170},
publisher = {IEEE},
title = {{Semi-Federated Scheduling of Mixed-Criticality System for Sporadic DAG Tasks}},
url = {https://ieeexplore.ieee.org/document/8759213/},
year = {2019}
}
@inproceedings{Li2016,
author = {Li, Jing and Ferry, David and Ahuja, Shaurya and Agrawal, Kunal and Gill, Christopher and Lu, Chenyang},
booktitle = {2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)},
address = {Vienna, Austria},
doi = {10.1109/RTAS.2016.7461340},
isbn = {978-1-4673-8639-5},
month = {apr},
pages = {1--12},
publisher = {IEEE},
title = {{Mixed-Criticality Federated Scheduling for Parallel Real-Time Tasks}},
url = {http://ieeexplore.ieee.org/document/7461340/},
year = {2016}
}
@inproceedings{Xu2015,
address = {New York, New York, USA},
author = {Xu, Hao and Burns, Alan},
booktitle = {Proceedings of the 23rd International Conference on Real Time and Networks Systems - RTNS '15},
doi = {10.1145/2834848.2834865},
isbn = {9781450335911},
pages = {257--266},
publisher = {ACM Press},
title = {{Semi-partitioned model for dual-core mixed criticality system}},
url = {http://dl.acm.org/citation.cfm?doid=2834848.2834865},
year = {2015}
}
@inproceedings{Al-bayati2015,
author = {Al-bayati, Zaid and {Qingling Zhao} and Youssef, Ahmed and {Haibo Zeng} and {Zonghua Gu}},
booktitle = {The 20th Asia and South Pacific Design Automation Conference},
address = {Tokyo, Japan},
doi = {10.1109/ASPDAC.2015.7059079},
isbn = {978-1-4799-7792-5},
month = {jan},
pages = {630--635},
publisher = {IEEE},
title = {{Enhanced partitioned scheduling of Mixed-Criticality Systems on multicore platforms}},
url = {http://ieeexplore.ieee.org/document/7059079/},
year = {2015}
}
@inproceedings{Li2012,
author = {Li, Haohan and Baruah, Sanjoy},
booktitle = {2012 24th Euromicro Conference on Real-Time Systems},
address = {Pisa, Italy},
doi = {10.1109/ECRTS.2012.41},
isbn = {978-1-4673-2032-0},
month = {jul},
pages = {166--175},
publisher = {IEEE},
title = {{Outstanding Paper Award: Global Mixed-Criticality Scheduling on Multiprocessors}},
url = {http://ieeexplore.ieee.org/document/6257569/},
year = {2012}
}
@inproceedings{Baruah2016,
author = {Baruah, Sanjoy},
booktitle = {2016 IEEE Real-Time Systems Symposium (RTSS)},
address = {Porto, Portugal},
doi = {10.1109/RTSS.2016.030},
isbn = {978-1-5090-5303-2},
month = {nov},
pages = {227--236},
publisher = {IEEE},
title = {{The Federated Scheduling of Systems of Mixed-Criticality Sporadic DAG Tasks}},
url = {http://ieeexplore.ieee.org/document/7809858/},
year = {2016}
}
@inproceedings{Su2013,
address = {New Jersey},
author = {Su, Hang and Zhu, Dakai},
address = {Grenoble, Freance},
booktitle = {Design, Automation {\&} Test in Europe Conference {\&} Exhibition (DATE), 2013},
doi = {10.7873/DATE.2013.043},
isbn = {9781467350716},
pages = {147--152},
publisher = {IEEE Conference Publications},
title = {{An Elastic Mixed-Criticality Task Model and Its Scheduling Algorithm}},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6513489},
year = {2013}
}
@inproceedings{Baruah1990,
author = {Baruah, S.K. and Mok, A.K. and Rosier, L.E.},
address = { Lake Buena Vista, FL, USA, USA},
booktitle = {[1990] Proceedings 11th Real-Time Systems Symposium},
doi = {10.1109/REAL.1990.128746},
isbn = {0-8186-2112-5},
pages = {182--190},
publisher = {IEEE},
title = {{Preemptively scheduling hard-real-time sporadic tasks on one processor}},
url = {http://ieeexplore.ieee.org/document/128746/},
year = {1990}
}
@article{Ekberg2014,
author = {Ekberg, Pontus and Yi, Wang},
doi = {10.1007/s11241-013-9187-z},
issn = {0922-6443},
journal = {Real-Time Systems},
keywords = {Demand bound functions,Earliest deadline first,Mixed-criticality,Real-time,Schedulability analysis},
month = {jan},
number = {1},
pages = {48--86},
publisher = {Kluwer Academic Publishers},
title = {{Bounding and shaping the demand of generalized mixed-criticality sporadic task systems}},
url = {http://link.springer.com/10.1007/s11241-013-9187-z},
volume = {50},
year = {2014}
}
@inproceedings{Baruah2012,
author = {Baruah, S. and Bonifaci, V. and DAngelo, G. and Li, H. and Marchetti-Spaccamela, A. and van der Ster, S. and Stougie, L.},
booktitle = {2012 24th Euromicro Conference on Real-Time Systems},
doi = {10.1109/ECRTS.2012.42},
isbn = {978-1-4673-2032-0},
month = {jul},
pages = {145--154},
publisher = {IEEE},
title = {{The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems}},
url = {http://ieeexplore.ieee.org/document/6257567/},
year = {2012}
}

@inproceedings{Stigge2011,
author = {Stigge, Martin and Ekberg, Pontus and Guan, Nan and Yi, Wang},
booktitle = {2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium},
doi = {10.1109/RTAS.2011.15},
isbn = {978-1-61284-326-1},
month = {apr},
pages = {71--80},
publisher = {IEEE},
title = {{The Digraph Real-Time Task Model}},
url = {http://ieeexplore.ieee.org/document/5767139/},
year = {2011}
}
@inproceedings{Yang2019a,
author = {Yang, Tao and Tang, Yue and Jiang, Xu and Deng, Qingxu and Guan, Nan},
booktitle = {2019 IEEE 22nd International Symposium on Real-Time Distributed Computing (ISORC)},
doi = {10.1109/ISORC.2019.00039},
isbn = {978-1-7281-0151-4},
month = {may},
pages = {163--170},
publisher = {IEEE},
title = {{Semi-Federated Scheduling of Mixed-Criticality System for Sporadic DAG Tasks}},
url = {https://ieeexplore.ieee.org/document/8759213/},
year = {2019}
}
@book{Buttazzo2011,
abstract = {3rd ed. This updated edition offers an indispensable exposition on real-time computing, with particular emphasis on predictable scheduling algorithms. It introduces the fundamental concepts of real-time computing, demonstrates the most significant results in the field, and provides the essential methodologies for designing predictable computing systems used to support time-critical control applications. Along with an in-depth guide to the available approaches for the implementation and analysis of real-time applications, this revised edition contains a close examination of recent developments in real-time systems, including limited preemptive scheduling, resource reservation techniques, overload handling algorithms, and adaptive scheduling techniques. This volume serves as a fundamental advanced-level textbook. Each chapter provides basic concepts, which are followed by algorithms, illustrated with concrete examples, figures and tables. Exercises and solutions are provided to enhance self-study, making this an excellent reference for those interested in real-time computing for designing and/or developing predictable control applications. A General View -- Basic Concepts -- A Periodic Task Scheduling -- Periodic Task Scheduling -- Fixed-Priority Servers -- Dynamic Priority Servers -- Resource Access Protocols -- Limited Preemptive Scheduling -- Handling Overload Conditions -- Kernel Design Issues -- Application Design Issues -- Real-Time Operating Systems and Standards -- Solutions to the Exercises -- References -- Index.},
author = {Buttazzo, Giorgio C.},
isbn = {9781461406761},
pages = {521},
publisher = {Springer},
title = {{Hard real-time computing systems : predictable scheduling algorithms and applications}},
year = {2011}
}
@article{KIM1996,
abstract = {{\textless}p{\textgreater}Improving the reliability of air cooled electronic equipment must include focusing on the life expectancy of the fans or blowers. Evaluating fan failure behavior, however, is not a trivial problem, as vendors report very little information on this subject. Even when product literature provides such data, one vendor's results are generally impossible to compare with another's due to different test procedures, different assumptions, and different calculation methods, not all of which are explicitly defined.{\textless}/p{\textgreater}},
author = {KIM, SUNG and VALLARINO, CARLOS and CLAASSEN, ALAN},
doi = {10.1142/S0218539396000077},
issn = {0218-5393},
journal = {International Journal of Reliability, Quality and Safety Engineering},
keywords = {Accelerated Life Testing,Average Hazard Rate,Failure Data Analysis,Fan Life Estimation,Mean Time To Failure},
month = {mar},
number = {01},
pages = {75--96},
publisher = { World Scientific Publishing Company },
title = {{REVIEW OF FAN LIFE EVALUATION PROCEDURES}},
url = {https://www.worldscientific.com/doi/abs/10.1142/S0218539396000077},
volume = {03},
year = {1996}
}
@inproceedings{Tian2006,
abstract = {Based on field return and test data, the major failure mechanisms and failure modes of cooling fan system are presented in this paper. Then, the failure criteria and the reliability metrics for cooling fan systems are discussed. By critically comparing the accelerated life testing methods from various vendors, a practical accelerated life testing methodology is presented. The acceleration testing models and acceleration factor are also discussed. In the last section, a comprehensive reliability qualification procedure is proposed. ?? 2006 IEEE.},
author = {Tian, Xijin},
booktitle = {Proceedings - Annual Reliability and Maintainability Symposium},
doi = {10.1109/RAMS.2006.1677404},
isbn = {1424400074},
issn = {0149144X},
keywords = {Accelerated testing,Cooling fan,Failure criteria,Qualification},
pages = {380--384},
publisher = {IEEE},
title = {{Cooling fan reliability: Failure criteria, accelerated life testing, modeling and qualification}},
url = {http://ieeexplore.ieee.org/document/1677404/},
year = {2006}
}
@article{Xiang2018,
author = {Xiang, Yi and Pasricha, Sudeep},
doi = {10.1016/j.vlsi.2017.11.007},
issn = {01679260},
journal = {Integration},
keywords = {Energy harvesting,Heterogeneous platforms,Mixed-criticality,Real-time systems,Task scheduling},
month = {mar},
number = {C},
pages = {114--124},
publisher = {Elsevier Science Publishers B. V.},
title = {{Mixed-criticality scheduling on heterogeneous multicore systems powered by energy harvesting}},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0167926017302602},
volume = {61},
year = {2018}
}
@inproceedings{Zhang2003,
abstract = {We present an integrated approach that provides fault tolerance and dynamic power management for a real-time task executing in an embedded system. Fault tolerance is achieved through an adaptive checkpointing scheme that dynamically adjusts the checkpointing interval during task execution. Adaptive checkpointing is then combined with a dynamic voltage scaling scheme to achieve power reduction. The resulting energy-aware adaptive checkpointing scheme uses a dynamic voltage scaling criterion that is based not only on the slack in task execution but also on the occurrences of faults during task execution. Simulation results show that compared to previous methods, the proposed approach significantly reduces power consumption and increases the likelihood of timely task completion in the presence of faults. {\textcopyright} 2003 IEEE.},
author = {Zhang, Ying and Chakrabarty, Krishnendu},
booktitle = {Proceedings -Design, Automation and Test in Europe, DATE},
doi = {10.1109/DATE.2003.1253723},
isbn = {0-7695-1870-2},
issn = {15301591},
pages = {918--923},
publisher = {IEEE Comput. Soc},
title = {{Energy-aware adaptive checkpointing in embedded real-time systems}},
url = {http://ieeexplore.ieee.org/document/1253723/},
year = {2003}
}
@article{Salehi2016,
author = {Salehi, Mohammad and {Khavari Tavana}, Mohammad and Rehman, Semeen and Shafique, Muhammad and Ejlali, Alireza and Henkel, Jorg},
doi = {10.1109/TVLSI.2015.2512839},
issn = {1063-8210},
journal = {IEEE Transactions on Very Large Scale Integration (VLSI) Systems},
month = {jul},
number = {7},
pages = {2426--2437},
title = {{Two-State Checkpointing for Energy-Efficient Fault Tolerance in Hard Real-Time Systems}},
url = {http://ieeexplore.ieee.org/document/7387782/},
volume = {24},
year = {2016}
}
@book{Koren2007,
abstract = {There are many applications in which the reliability of the overall system must be far higher than the reliability of its individual components. In such cases, designers devise mechanisms and architectures that allow the system to either completely mask the effects of a component failure or recover from it so quickly that the application is not seriously affected. This is the work of fault-tolerant designers and their work is increasingly important and complex not only because of the increasing number of mission critical applications, but also because the diminishing reliability of hardware means that even systems for non-critical applications will need to be designed with fault-tolerance in mind. Reflecting the real-world challenges faced by designers of these systems, this book addresses fault tolerance design with a systems approach to both hardware and software. No other text on the market takes this approach, nor offers the comprehensive and up-to-date treatment Koren and Krishna provide. Students, designers and architects of high performance processors will value this comprehensive overview of the field. * The first book on fault tolerance design with a systems approach * Comprehensive coverage of both hardware and software fault tolerance, as well as information and time redundancy * Incorporated case studies highlight six different computer systems with fault-tolerance techniques implemented in their design * Available to lecturers is a complete ancillary package including online solutions manual for instructors and PowerPoint slides. Introduction -- Hardware Fault Tolerance -- Information Redundancy -- Checkpointing -- Software Fault Tolerance -- Fault-tolerant Networks -- Case Studies -- Defect Tolerance in VLSI -- Fault Tolerance in Cryptography -- Experimental and Simulation Techniques.},
author = {Koren, Israel and Krishna, C. M. (C. Mani)},
isbn = {0080492681},
pages = {378},
publisher = {Elsevier/Morgan Kaufmann},
title = {{Fault-tolerant systems}},
url = {https://books.google.co.uk/books/about/Fault{\_}Tolerant{\_}Systems.html?id=o{\_}Pjbo4Wvp8C{\&}printsec=frontcover{\&}source=kp{\_}read{\_}button{\&}redir{\_}esc=y{\#}v=onepage{\&}q{\&}f=false},
year = {2007}
}
@book{Pradhan1996,
abstract = {1. An Introduction to the Design and Analysis of Fault-Tolerant Systems / Barry W. Johnson -- 2. Architecture of Fault-Tolerant Computers / D. Siewiorek -- 3. Fault Tolerant Multiprocessor and Distributed Systems: Principles / Dhiraj K. Pradhan and Prith Banerjee -- 4. Case Studies in Fault Tolerant Multiprocessor and Distributes Systems / Dhiraj K. Pradhan -- 5. Experimental Analysis of Computer System Dependability / Ravishankar K. Iyer and Dong Tang -- 6. Reliability Estimation / J.J. Stiffler -- 7. Fault Tolerance in Software / Herbert Hecht and Myron Hecht -- 8. System Diagnosis / Gerald M. Masson, Douglas M. Blough and Gregory F. Sullivan.},
author = {Pradhan, Dhiraj K.},
isbn = {0130578878},
pages = {550},
publisher = {Prentice Hall PTR},
title = {{Fault-tolerant computer system design}},
url = {https://books.google.co.uk/books/about/Fault{\_}tolerant{\_}Computer{\_}System{\_}Design.html?id=SqPDswEACAAJ{\&}redir{\_}esc=y},
year = {1996}
}
@inproceedings{Baruah2008,
author = {Baruah, Sanjoy and Vestal, Steve},
address = {Prague},
booktitle = {2008 Euromicro Conference on Real-Time Systems},
doi = {10.1109/ECRTS.2008.26},
isbn = {978-0-7695-3298-1},
month = {jul},
pages = {147--155},
publisher = {IEEE},
title = {{Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications}},
url = {http://ieeexplore.ieee.org/document/4573111/},
year = {2008}
}
@inproceedings{Baruah2011,
	address = {Vienna, Austria},
author = {Baruah, S.K. and Burns, A. and Davis, R.I.},
booktitle = {2011 IEEE 32nd Real-Time Systems Symposium},
doi = {10.1109/RTSS.2011.12},
isbn = {978-1-4577-2000-0},
month = {nov},
pages = {34--43},
publisher = {IEEE},
title = {{Response-Time Analysis for Mixed Criticality Systems}},
url = {http://ieeexplore.ieee.org/document/6121424/},
year = {2011}
}
@article{Saraswat2009,
author = {Saraswat, Prabhat Kumar and Pop, Paul and Madsen, Jan},
doi = {10.1145/1851340.1851348},
issn = {15513688},
journal = {ACM SIGBED Review},
month = {oct},
number = {3},
pages = {1},
publisher = {ACM},
title = {{Task migration for fault-tolerance in mixed-criticality embedded systems}},
url = {http://portal.acm.org/citation.cfm?doid=1851340.1851348},
volume = {6},
year = {2009}
}
@article{Li2016a,
author = {Li, Zheng and Guo, Chunhui and Hua, Xiayu and Ren, Shangping},
doi = {10.1016/j.jss.2015.10.029},
issn = {01641212},
journal = {Journal of Systems and Software},
keywords = {Energy,Mixed-criticality,Reliability},
month = {feb},
number = {C},
pages = {1--10},
publisher = {Elsevier Science Inc.},
title = {{Reliability guaranteed energy minimization on mixed-criticality systems}},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0164121215002289},
volume = {112},
year = {2016}
}
@article{Baruah2015,
author = {Baruah, Sanjoy and Bonifaci, Vincenzo and D'angelo, Gianlorenzo and Li, Haohan and Marchetti-Spaccamela, Alberto and {Van Der Ster}, Suzanne and Stougie, Leen},
doi = {10.1145/2699435},
issn = {00045411},
journal = {Journal of the ACM},
keywords = {Mixed criticality,preemptive scheduling,sporadic task system},
month = {may},
number = {2},
pages = {1--33},
publisher = {ACM},
title = {{Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems}},
url = {http://dl.acm.org/citation.cfm?doid=2772377.2699435},
volume = {62},
year = {2015}
}
@book{Marwedel2011,
abstract = {2nd ed. Until the late 1980s, information processing was associated with large mainframe computers and huge tape drives. During the 1990s, this trend shifted toward information processing with personal computers, or PCs. The trend toward miniaturization continues and in the future the majority of information processing systems will be small mobile computers, many of which will be embedded into larger products and interfaced to the physical environment. Hence, these kinds of systems are called embedded systems. Embedded systems together with their physical environment are called cyber-physical systems. Specifications and Modeling; Embedded System Hardware; System Software; Evaluation and Validation; Application mapping; Optimization; Test; Integer linear programming; Kirchhoff's laws and operational amplifiers.},
author = {Marwedel, Peter},
isbn = {9789400702578},
pages = {389},
publisher = {Springer},
title = {{Embedded system design : embedded systems foundations of cyber-physical systems}},
year = {2011}
}
@inproceedings{Baruah2012a,
author = {Baruah, S. and Bonifaci, V. and DAngelo, G. and Li, H. and Marchetti-Spaccamela, A. and van der Ster, S. and Stougie, L.},
booktitle = {2012 24th Euromicro Conference on Real-Time Systems},
doi = {10.1109/ECRTS.2012.42},
isbn = {978-1-4673-2032-0},
month = {jul},
pages = {145--154},
publisher = {IEEE},
title = {{The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems}},
url = {http://ieeexplore.ieee.org/document/6257567/},
year = {2012}
}
@inproceedings{Huang2014,
address = {New York, New York, USA},
author = {Huang, Pengcheng and Yang, Hoeseok and Thiele, Lothar},
booktitle = {Proceedings of the The 51st Annual Design Automation Conference on Design Automation Conference - DAC '14},
doi = {10.1145/2593069.2593169},
isbn = {9781450327305},
pages = {1--6},
publisher = {ACM Press},
title = {{On the Scheduling of Fault-Tolerant Mixed-Criticality Systems}},
url = {http://dl.acm.org/citation.cfm?doid=2593069.2593169},
year = {2014}
}
@inproceedings{Zeng2016,
address = {New York, New York, USA},
author = {Zeng, Luyuan and Huang, Pengcheng and Thiele, Lothar},
booktitle = {Proceedings of the International Conference on Compilers, Architectures and Synthesis for Embedded Systems - CASES '16},
doi = {10.1145/2968455.2968515},
isbn = {9781450344821},
pages = {1--10},
publisher = {ACM Press},
title = {{Towards the design of fault-tolerant mixed-criticality systems on multicores}},
url = {http://dl.acm.org/citation.cfm?doid=2968455.2968515},
year = {2016}
}
@article{Han2018,
author = {Han, Jian-Jun and Tao, Xin and Zhu, Dakai and Aydin, Hakan and Shao, Zili and Yang, Laurence T.},
doi = {10.1109/TCAD.2017.2697955},
issn = {0278-0070},
journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
month = {jan},
number = {1},
pages = {21--34},
title = {{Multicore Mixed-Criticality Systems: Partitioned Scheduling and Utilization Bound}},
url = {http://ieeexplore.ieee.org/document/7911297/},
volume = {37},
year = {2018}
}
@inproceedings{Vestal2007,
author = {Vestal, Steve},
address = {Tucson, Arizona, USA},
booktitle = {28th IEEE International Real-Time Systems Symposium (RTSS 2007)},
doi = {10.1109/RTSS.2007.47},
isbn = {0-7695-3062-1},
month = {dec},
pages = {239--243},
publisher = {IEEE},
title = {{Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance}},
url = {http://ieeexplore.ieee.org/document/4408308/},
year = {2007}
}
@inproceedings{Singh2013,
abstract = {The reliance on multi/many-core systems to satisfy the high performance requirement of complex embedded software applications is increasing. This necessitates the need to realize efficient mapping methodologies for such complex computing platforms. This paper provides an extensive survey and categorization of state-of-the-art mapping methodologies and highlights the emerging trends for multi/many-core systems. The methodologies aim at optimizing system's resource usage, performance, power consumption, temperature distribution and reliability for varying application models. The methodologies perform design-time and run-time optimization for static and dynamic workload scenarios, respectively. These optimizations are necessary to fulfill the end-user demands. Comparison of the methodologies based on their optimization aim has been provided. The trend followed by the methodologies and open research challenges have also been discussed.},
address = {New York, New York, USA},
author = {Singh, Amit Kumar and Shafique, Muhammad and Kumar, Akash and Henkel, J{\"{o}}rg},
booktitle = {Proceedings of the 50th Annual Design Automation Conference on - DAC '13},
doi = {10.1145/2463209.2488734},
isbn = {9781450320719},
pages = {1},
publisher = {ACM Press},
title = {{Mapping on multi/many-core systems}},
url = {http://dl.acm.org/citation.cfm?doid=2463209.2488734},
year = {2013}
}
@article{Safari2019,
author = {Safari, Sepideh and Ansari, Mohsen and Ershadi, Ghazal and Hessabi, Shaahin},
doi = {10.1109/tpds.2019.2907846},
issn = {1045-9219},
journal = {IEEE Transactions on Parallel and Distributed Systems},
pages = {1--1},
title = {{On the Scheduling of Energy-Aware Fault-Tolerant Mixed-Criticality Multicore Systems with Service Guarantee Exploration}},
url = {https://ieeexplore.ieee.org/document/8675526/},
year = {2019}
}
@inproceedings{Thekkilakattil2014,
abstract = {Modern safety critical real-time systems are composed of tasks of mixed criticalities and the problem of scheduling them in a fault tolerant manner, on a distributed platform, is challenging. Fault tolerance is typically achieved by using redundancy techniques, most commonly in the form of temporal redundancy which involves executing an alternate task before the original deadline of the failed task. Additionally, studies like Zonal Hazard Analysis (ZHA) and Fault Hazard Analysis (FHA) may impose extra constraints on the re-executions, e.g., spatial separation of alternates, to improve reliability. In this paper, we present a method for scheduling mixed criticality real-time tasks on a distributed platform in a fault tolerant manner while taking into account the recommendations given by the reliability studies like ZHA and FHA. First, we use mathematical optimization to allocate tasks on the processors, and then derive fault tolerant and fault aware feasibility windows for the critical and non-critical tasks respectively. Finally, we derive scheduler specific task attributes like priorities for the fixed priority scheduler. Our method provides hard real-time fault tolerance guarantees for critical tasks while maximizing resource utilization for non-critical tasks},
author = {Thekkilakattil, Abhilash and Dobrin, Radu and Punnekkat, Sasikumar},
booktitle = {International Conference on Embedded Systems, ICES 2014},
doi = {10.1109/EmbeddedSys.2014.6953097},
isbn = {9781479950263},
keywords = {Fault-tolerance Realtime Systems,Mixed Criticality Scheduling},
month = {jul},
pages = {92--97},
publisher = {IEEE},
title = {{Mixed criticality scheduling in fault-tolerant distributed real-time systems}},
url = {http://ieeexplore.ieee.org/document/6953097/},
year = {2014}
}
@article{Pathan2014,
abstract = {The design and analysis of real-time scheduling algorithms for safety-critical systems is a challenging problem due to the temporal dependencies among different design constraints. This paper considers scheduling sporadic tasks with three interrelated design constraints: (i) meeting the hard deadlines of application tasks, (ii) providing fault tolerance by executing backups, and (iii) respecting the criticality of each task to facilitate system's certification. First, a new approach to model mixed-criticality systems from the perspective of fault tolerance is proposed. Second, a uniprocessor fixed-priority scheduling algorithm, called fault-tolerant mixed-criticality (FTMC) scheduling, is designed for the proposed model. The FTMC algorithm executes backups to recover from task errors caused by hardware or software faults. Third, a sufficient schedulability test is derived, when satisfied for a (mixed-criticality) task set, guarantees that all deadlines are met even if backups are executed to recover from errors. Finally, evaluations illustrate the effectiveness of the proposed test.},
author = {Pathan, Risat Mahmud},
doi = {10.1007/s11241-014-9202-z},
issn = {09226443},
journal = {Real-Time Systems},
keywords = {Fault-tolerance,Fixed-priority scheduling,Mixed-criticality systems,Real-time scheduling,Run-time support},
month = {jul},
number = {4},
pages = {509--547},
publisher = {Springer US},
title = {{Fault-tolerant and real-time scheduling for mixed-criticality systems}},
url = {http://link.springer.com/10.1007/s11241-014-9202-z},
volume = {50},
year = {2014}
}
@inproceedings{Baruah2010,
author = {Baruah, Sanjoy and Li, Haohan and Stougie, Leen},
booktitle = {2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium},
doi = {10.1109/RTAS.2010.10},
isbn = {978-1-4244-6690-0},
month = {apr},
pages = {13--22},
publisher = {IEEE},
title = {{Towards the Design of Certifiable Mixed-criticality Systems}},
url = {http://ieeexplore.ieee.org/document/5465960/},
year = {2010}
}
@article{Fisher2011,
author = {Fisher, Nathan and Chen, Jian-Jia and Wang, Shengquan and Thiele, Lothar},
doi = {10.1016/j.sysarc.2010.09.010},
issn = {13837621},
journal = {Journal of Systems Architecture},
keywords = {Dynamic voltage scaling,Global real-time scheduling,Multicore systems,Thermal-aware scheduling},
month = {may},
number = {5},
pages = {547--560},
publisher = {Elsevier North-Holland, Inc.},
title = {{Thermal-aware global real-time scheduling and analysis on multicore systems}},
url = {https://linkinghub.elsevier.com/retrieve/pii/S138376211000127X},
volume = {57},
year = {2011}
}
@article{Ansari2019c,
abstract = {Multicore platforms provide a great opportunity for implementation of fault-tolerance techniques to achieve high reliability in real-time embedded systems. Passive redundancy is well-suited for multicore platforms and a well-established technique to tolerate transient and permanent faults. However, it incurs significant power overheads, which go wasted in fault-free execution scenarios. Meanwhile, due to the Thermal Design Power (TDP) constraint, in some cases, it is not feasible to simultaneously power on all cores on a multicore platform. Since TDP is the maximum sustainable power that a chip can consume, violating TDP makes some cores automatically restart or significantly reduce their performance to prevent a permanent damage. This may affect timeliness of the system, and hence, designers face a challenge in deciding how to use multicore platforms in real-time embedded systems. In this paper, at first, we study how the use of passive redundancy (especially for Triple Modular redundancy) can violate TDP on multicore platforms. Then, we propose a scheme for scheduling real-time tasks in multicore systems to conquer the peak power problem in NMR systems. This is because in multicore embedded systems an efficient solution for meeting the TDP constraint is reducing the peak power consumption. The proposed scheme tries to remove overlaps of the peak power of concurrently executing tasks to keep the maximum power consumption below the chip TDP. In the proposed scheme, we devised a policy called PPA-LTF to manage peak power consumption. This policy prevents tasks execution that consume higher power according to the tasks' power traces. Our experimental results show that our scheme provides up to 50 percent (on average by 39 percent) peak power reduction compared to state-of-the-art schemes.},
author = {Ansari, Mohsen and Safari, Sepideh and Yeganeh-Khaksar, Amir and Salehi, Mohammad and Ejlali, Alireza},
doi = {10.1109/TPDS.2018.2858816},
issn = {15582183},
journal = {IEEE Transactions on Parallel and Distributed Systems},
keywords = {Peak power consumption,embedded systems,fault tolerance,multicore platforms,thermal design power},
month = {jan},
number = {1},
pages = {161--173},
title = {{Peak Power Management to Meet Thermal Design Power in Fault-Tolerant Embedded Systems}},
url = {https://ieeexplore.ieee.org/document/8419269/},
volume = {30},
year = {2019}
}
@article{Li2018,
abstract = {Fluid scheduling allows tasks to be allocated with fractional processing capacity, which significantly improves the schedulability performance. For dual-criticality systems (DCS), dual-rate fluid-based scheduling has been widely studied, e.g., the state-of-the-art approaches mixed-criticality fluid scheduling (MCF) and MC-Sort. However, most of the existing works on DCS either only focus on the schedulability analysis or minimize the energy consumption treating leakage power as a constant. To this end, this paper considers the effect of temperature on leakage power and proposes a thermal and power aware fluid scheduling strategy, referred to as thermal and energy aware (TA)-MCF which minimizes both the energy consumption and temperature, while ensuring a comparable schedulability ratio compared with the MCF and MC-Sort. Extensive experiments validate the efficiency of TA-MCF.},
author = {Li, Tiantian and Zhang, Tianyu and Yu, Ge and Zhang, Yichuan and Song, Jie},
doi = {10.1142/s0218126619500294},
issn = {0218-1266},
journal = {Journal of Circuits, Systems and Computers},
month = {feb},
number = {02},
pages = {1950029},
title = {{TA-MCF: Thermal-Aware Fluid Scheduling for Mixed-Criticality System}},
url = {https://www.worldscientific.com/doi/abs/10.1142/S0218126619500294},
volume = {28},
year = {2018}
}
@article{Khdr2017,
abstract = {{\textcopyright} 2017 IEEE. Increasing power densities have led to the dark silicon era, for which heterogeneous multicores with different power and performance characteristics are promising architectures. This paper focuses on maximizing the overall system performance under a critical temperature constraint for heterogeneous tiled multicores, where all cores or accelerators inside a tile share the same voltage and frequency levels. For such architectures, we present a resource management technique that introduces power density as a novel system level constraint, in order to avoid thermal violations. The proposed technique then assigns applications to tiles by choosing their degree of parallelism and the voltage/frequency levels of each tile, such that the power density constraint is satisfied. Moreover, our technique provides runtime adaptation of the power density constraint according to the characteristics of the executed applications, and reacting to workload changes at runtime. Thus, the available thermal headroom is exploited to maximize the overall system performance.},
author = {Khdr, Heba and Pagani, Santiago and Sousa, {\'{E}}ricles and Lari, Vahid and Pathania, Anuj and Hannig, Frank and Shafique, Muhammad and Teich, J{\"{u}}rgen and Henkel, J{\"{o}}rg},
doi = {10.1109/TC.2016.2595560},
issn = {00189340},
journal = {IEEE Transactions on Computers},
keywords = {Heterogeneous multicores,dark silicon,low power design,power density,resource management,thermal management},
month = {mar},
number = {3},
pages = {488--501},
title = {{Power Density-Aware Resource Management for Heterogeneous Tiled Multicores}},
url = {http://ieeexplore.ieee.org/document/7524768/},
volume = {66},
year = {2017}
}
@inproceedings{Medina2019,
address = {Neshville, Tennessee, USA},
author = {Medina, Roberto and Borde, Etienne and Pautet, Laurent},
booktitle = {Proceedings - Real-Time Systems Symposium},
doi = {10.1109/RTSS.2018.00042},
isbn = {9781538679074},
issn = {10528725},
keywords = {Mixed criticality,directed acyclic graphs,multi-core,real-time systems},
month = {dec},
pages = {254--264},
publisher = {IEEE},
title = {{Scheduling Multi-periodic Mixed-Criticality DAGs on Multi-core Architectures}},
url = {https://ieeexplore.ieee.org/document/8603218/},
volume = {2018-Decem},
year = {2019}
}
@techreport{IntelCorporation2006,
author = {{Intel Corporation}},
title = {{Dual-Core Intel Xeon Processor 5100 Series Datasheet}},
url = {https://www.intel.com/Assets/PDF/datasheet/313355.pdf},
year = {2006}
}
@article{Pagani2017,
author = {Pagani, Santiago and Khdr, Heba and Chen, Jian-Jia and Shafique, Muhammad and Li, Minming and Henkel, Jorg},
doi = {10.1109/TC.2016.2564969},
issn = {0018-9340},
journal = {IEEE Transactions on Computers},
month = {jan},
number = {1},
pages = {147--162},
title = {{Thermal Safe Power (TSP): Efficient Power Budgeting for Heterogeneous Manycore Systems in Dark Silicon}},
url = {http://ieeexplore.ieee.org/document/7466857/},
volume = {66},
year = {2017}
}
@article{Baruah2012b,
abstract = {Many safety-critical embedded systems are subject to certification$\backslash$nrequirements; some systems may be required to meet multiple sets$\backslash$nof certification requirements, from different certification authorities.$\backslash$nCertification requirements in such "mixed-criticality{\{}$\backslash$textquotedblright{\}}$\backslash$nsystems give rise to interesting scheduling problems, that cannot$\backslash$nbe satisfactorily addressed using techniques from conventional scheduling$\backslash$ntheory. In this paper, we study a formal model for representing such$\backslash$nmixed-criticality workloads. We demonstrate first the intractability$\backslash$nof determining whether a system specified in this model can be scheduled$\backslash$nto meet all its certification requirements, even for systems subject$\backslash$nto merely two sets of certification requirements. Then we quantify,$\backslash$nvia the metric of processor speedup factor, the effectiveness of$\backslash$ntwo techniques, reservation-based scheduling and priority-based scheduling,$\backslash$nthat are widely used in scheduling such mixed-criticality systems,$\backslash$nshowing that the latter of the two is superior to the former. We$\backslash$nalso show that the speedup factors we obtain are tight for these$\backslash$ntwo techniques.},
author = {Baruah, Sanjoy and Bonifaci, Vincenzo and D'Angelo, Gianlorenzo and Li, Haohan and Marchetti-Spaccamela, Alberto and Megow, Nicole and Stougie, Leen},
doi = {10.1109/TC.2011.142},
issn = {00189340},
journal = {IEEE Transactions on Computers},
keywords = {Preemptive scheduling,certification.,mixed criticality,safety-critical systems},
month = {aug},
number = {8},
pages = {1140--1152},
title = {{Scheduling real-time mixed-criticality jobs}},
url = {http://ieeexplore.ieee.org/document/5963646/},
volume = {61},
year = {2012}
}
@inproceedings{Hu2016,
address = {New York, New York, USA},
author = {Hu, Biao and Huang, Kai and Huang, Pengcheng and Thiele, Lothar and Knoll, Alois},
booktitle = {Proceedings of the 13th International Conference on Embedded Software - EMSOFT '16},
doi = {10.1145/2968478.2968491},
isbn = {9781450344852},
pages = {1--10},
publisher = {ACM Press},
title = {{On-the-fly fast overrun budgeting for mixed-criticality systems}},
url = {http://dl.acm.org/citation.cfm?doid=2968478.2968491},
year = {2016}
}
@article{Han2014,
author = {Han, Qiushi and Niu, Linwei and Quan, Gang and Ren, Shaolei and Ren, Shangping},
doi = {10.1007/s11241-014-9210-z},
issn = {0922-6443},
journal = {Real-Time Systems},
month = {nov},
number = {5-6},
pages = {592--619},
publisher = {Springer US},
title = {{Energy efficient fault-tolerant earliest deadline first scheduling for hard real-time systems}},
url = {http://link.springer.com/10.1007/s11241-014-9210-z},
volume = {50},
year = {2014}
}
@inproceedings{Sridharan2010,
address = {New York, New York, USA},
author = {Sridharan, Ranjani and Mahapatra, Rabi},
booktitle = {Proceedings of the 47th Design Automation Conference on - DAC '10},
doi = {10.1145/1837274.1837480},
isbn = {9781450300025},
pages = {819},
publisher = {ACM Press},
title = {{Reliability aware power management for dual-processor real-time embedded systems}},
url = {http://portal.acm.org/citation.cfm?doid=1837274.1837480},
year = {2010}
}
@article{Aydin2009,
author = {Aydin, H. and {Dakai Zhu}},
doi = {10.1109/TC.2009.56},
issn = {0018-9340},
journal = {IEEE Transactions on Computers},
month = {oct},
number = {10},
pages = {1382--1397},
title = {{Reliability-Aware Energy Management for Periodic Real-Time Tasks}},
url = {http://ieeexplore.ieee.org/document/4815213/},
volume = {58},
year = {2009}
}
@inproceedings{Zhang2003a,
abstract = {We present an integrated approach that provides fault tolerance and dynamic power management for a real-time task executing in an embedded system. Fault tolerance is achieved through an adaptive checkpointing scheme that dynamically adjusts the checkpointing interval during task execution. Adaptive checkpointing is then combined with a dynamic voltage scaling scheme to achieve power reduction. The resulting energy-aware adaptive checkpointing scheme uses a dynamic voltage scaling criterion that is based not only on the slack in task execution but also on the occurrences of faults during task execution. Simulation results show that compared to previous methods, the proposed approach significantly reduces power consumption and increases the likelihood of timely task completion in the presence of faults. {\textcopyright} 2003 IEEE.},
author = {Zhang, Ying and Chakrabarty, Krishnendu},
booktitle = {Proceedings -Design, Automation and Test in Europe, DATE},
doi = {10.1109/DATE.2003.1253723},
isbn = {0-7695-1870-2},
issn = {15301591},
pages = {918--923},
publisher = {IEEE Comput. Soc},
title = {{Energy-aware adaptive checkpointing in embedded real-time systems}},
url = {http://ieeexplore.ieee.org/document/1253723/},
year = {2003}
}
@inproceedings{Tavana2011,
author = {Tavana, Mohammad Khavari and Salehi, Mohammad and Ejlali, Alireza},
booktitle = {2011 IEEE 32nd Real-Time Systems Symposium},
doi = {10.1109/RTSS.2011.39},
isbn = {978-1-4577-2000-0},
month = {nov},
pages = {349--356},
publisher = {IEEE},
title = {{Feedback-Based Energy Management in a Standby-Sparing Scheme for Hard Real-Time Systems}},
url = {http://ieeexplore.ieee.org/document/6121408/},
year = {2011}
}
@article{Ejlali2012,
author = {Ejlali, Alireza and Al-Hashimi, Bashir M. and Eles, Petru},
doi = {10.1109/TCAD.2011.2173488},
issn = {0278-0070},
journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
month = {mar},
number = {3},
pages = {329--342},
title = {{Low-Energy Standby-Sparing for Hard Real-Time Systems}},
url = {http://ieeexplore.ieee.org/document/6152774/},
volume = {31},
year = {2012}
}
@inproceedings{Haque2013,
author = {Haque, Mohammad A. and Aydin, Hakan and Zhu, Dakai},
booktitle = {2013 International Green Computing Conference Proceedings},
doi = {10.1109/IGCC.2013.6604487},
isbn = {978-1-4799-0623-9},
month = {jun},
pages = {1--10},
publisher = {IEEE},
title = {{Energy management of standby-sparing systems for fixed-priority real-time workloads}},
url = {http://ieeexplore.ieee.org/document/6604487/},
year = {2013}
}
@inproceedings{Haque2011,
author = {Haque, Mohammad A. and Aydin, Hakan and Zhu, Dakai},
booktitle = {2011 IEEE 29th International Conference on Computer Design (ICCD)},
doi = {10.1109/ICCD.2011.6081396},
isbn = {978-1-4577-1954-7},
month = {oct},
pages = {190--197},
publisher = {IEEE},
title = {{Energy-aware Standby-Sparing Technique for periodic real-time applications}},
url = {http://ieeexplore.ieee.org/document/6081396/},
year = {2011}
}
@inproceedings{Ejlali2009,
address = {New York, New York, USA},
author = {Ejlali, Alireza and Al-Hashimi, Bashir M. and Eles, Petru},
booktitle = {Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis - CODES+ISSS '09},
doi = {10.1145/1629435.1629463},
isbn = {9781605586281},
keywords = {energy minimization,hard real-time systems,reliability},
pages = {193},
publisher = {ACM Press},
title = {{A standby-sparing technique with low energy-overhead for fault-tolerant hard real-time systems}},
url = {http://portal.acm.org/citation.cfm?doid=1629435.1629463},
year = {2009}
}
@article{Ejlali2006,
author = {Ejlali, A. and Al-Hashimi, B.M. and Schmitz, M.T. and Rosinger, P. and Miremadi, S.G.},
doi = {10.1109/TVLSI.2006.874355},
issn = {1063-8210},
journal = {IEEE Transactions on Very Large Scale Integration (VLSI) Systems},
month = {apr},
number = {4},
pages = {323--335},
title = {{Combined time and information redundancy for SEU-tolerance in energy-efficient real-time systems}},
url = {http://ieeexplore.ieee.org/document/1637463/},
volume = {14},
year = {2006}
}
@inproceedings{Poursafaei2015,
author = {Poursafaei, Farimah R. and Safari, Sepideh and Ansari, Mohsen and Salehi, Mohammad and Ejlali, Alireza},
booktitle = {2015 CSI Symposium on Real-Time and Embedded Systems and Technologies (RTEST)},
doi = {10.1109/RTEST.2015.7369847},
isbn = {978-1-4673-8047-8},
month = {oct},
pages = {1--7},
publisher = {IEEE},
title = {{Offline replication and online energy management for hard real-time multicore systems}},
url = {http://ieeexplore.ieee.org/document/7369847/},
year = {2015}
}
@article{Haque2017,
author = {Haque, Mohammad A. and Aydin, Hakan and Zhu, Dakai},
doi = {10.1109/TPDS.2016.2600595},
issn = {1045-9219},
journal = {IEEE Transactions on Parallel and Distributed Systems},
month = {mar},
number = {3},
pages = {813--825},
title = {{On Reliability Management of Energy-Aware Real-Time Systems Through Task Replication}},
url = {http://ieeexplore.ieee.org/document/7544521/},
volume = {28},
year = {2017}
}
@inproceedings{Zhu2004a,
abstract = {The slack time in real-time systems can be used by recovery schemes to increase system reliability as well as by frequency and voltage scaling techniques to save energy. Moreover, the rate of transient faults (i.e., soft errors caused, for example, by cosmic ray radiations) also depends on system operating frequency and supply voltage. Thus, there is an interesting trade-off between system reliability and energy consumption. This paper first investigates the effects of frequency and voltage scaling on the fault rate and proposes two fault rate models based on previously published data. Then, the effects of energy management on reliability is studied. Our analysis results show that, energy management through frequency and voltage scaling could dramatically reduce system reliability, and ignoring the effects of energy management on the fault rate is too optimistic and may lead to unsatisfied system reliability. {\textcopyright} 2004 IEEE.},
author = {Zhu, Dakai and Melhem, Rami and Moss{\'{e}}, Daniel},
booktitle = {IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD},
doi = {10.1109/iccad.2004.1382539},
isbn = {0-7803-8702-3},
issn = {10923152},
pages = {35--40},
publisher = {IEEE},
title = {{The effects of energy management on reliability in real-time embedded systems}},
url = {http://ieeexplore.ieee.org/document/1382539/},
year = {2004}
}
@article{Ernst2004,
author = {Ernst, D. and Das, S. and Lee, S. and Blaauw, D. and Austin, T. and Mudge, T. and {Nam Sung Kim} and Flautner, K.},
doi = {10.1109/MM.2004.85},
issn = {0272-1732},
journal = {IEEE Micro},
month = {nov},
number = {6},
pages = {10--20},
title = {{Razor: circuit-level correction of timing errors for low-power operation}},
url = {http://ieeexplore.ieee.org/document/1388152/},
volume = {24},
year = {2004}
}
@book{Johnson1989,
author = {Johnson, BW},
title = {{Design and analysis of fault-tolerant digital systems}},
url = {http://epubprose.info/design-and-analysis-of-fault-tolerant-digital-systems-download-free-kindle-books-barry-w-johnson.pdf},
year = {1989}
}
@article{Constantinescu2003,
author = {Constantinescu, C.},
doi = {10.1109/MM.2003.1225959},
issn = {0272-1732},
journal = {IEEE Micro},
month = {jul},
number = {4},
pages = {14--19},
title = {{Trends and challenges in VLSI circuit reliability}},
url = {http://ieeexplore.ieee.org/document/1225959/},
volume = {23},
year = {2003}
}
@inproceedings{Briggs2005,
author = {Briggs, Gregory J and Tan, Edwin J and Nelson, Nicholas A and Albonesi, David H},
booktitle = {WCAE '05: Proceedings of the 2005 workshop on Computer architecture education},
doi = {http://doi.acm.org/10.1145/1275604.1275613},
pages = {5},
title = {{QUILT: a GUI-based integrated circuit floorplanning environment for computer architecture research and education}},
url = {https://dl.acm.org/citation.cfm?id=1275613},
year = {2005}
}
@inproceedings{Medina2017a,
abstract = {{\textcopyright} Springer International Publishing AG 2017. Deploying safety-critical systems into constrained embedded platforms is a challenge for developers who must arbitrate between two conflicting objectives: software has to be safe and resources need to be used efficiently. Mixed-criticality (MC) has been proposed to meet a trade-off between these two aspects. Nonetheless, most task models considered in the literature of MC scheduling, do not take into account precedence constraints among tasks. In this paper, we propose a multicore scheduling approach for a model presenting MC tasks and their dependencies as a Directed Acyclic Graph (DAG). We also introduce an evaluation framework for this model, released as an open source software. Evaluation of our scheduling algorithm provides evidence of the difficulty to find correct scheduling for DAGs of MC tasks. Besides, experimentation results provided in this paper show that our scheduling algorithm outperforms existing algorithms for scheduling DAGs of MC tasks.},
author = {Medina, Roberto and Borde, Etienne and Pautet, Laurent},
booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
doi = {10.1007/978-3-319-60588-3_14},
isbn = {9783319605876},
issn = {16113349},
keywords = {Directed acyclic graphs,Mixed-criticality,Mode transition,Real-time scheduling},
pages = {217--232},
title = {{Directed acyclic graph scheduling for mixed-criticality systems}},
url = {https://link.springer.com/chapter/10.1007/978-3-319-60588-3{\_}14},
volume = {10300 LNCS},
year = {2017}
}
@article{sethi2015multicore,
author = {Sethi, Anil and Kushwah, Himanshu},
journal = {International Journal of Research in Engineering and Technology},
number = {09},
pages = {87--89},
title = {{Multicore processor technology-advantages and challenges}},
volume = {4},
year = {2015}
}
@inproceedings{Guthaus2001,
abstract = {This paper examines a set of commercially representative embedded programs and compares them to an existing benchmark suite, SPEC2000. A new version of SimpleScalar that has been adapted to the ARM instruction set is used to characterize the performance of the benchmarks using configurations similar to current and next generation embedded processors. Several characteristics distinguish the representative embedded programs from the existing SPEC benchmarks including instruction distribution, memory behavior, and available parallelism. The embedded benchmarks, called MiBench, are freely available to all researchers.},
author = {Guthaus, M. R. and Ringenberg, J. S. and Ernst, D. and Austin, T. M. and Mudge, T. and Brown, R. B.},
booktitle = {2001 IEEE International Workshop on Workload Characterization, WWC 2001},
doi = {10.1109/WWC.2001.990739},
isbn = {0780373154},
pages = {3--14},
publisher = {IEEE},
title = {{MiBench: A free, commercially representative embedded benchmark suite}},
url = {http://ieeexplore.ieee.org/document/990739/},
year = {2001}
}
@article{Burns2017,
author = {Burns, Alan and Davis, Robert I.},
doi = {10.1145/3131347},
issn = {03600300},
journal = {ACM Computing Surveys},
keywords = {Real-time systems,mixed criticality systems,scheduling},
month = {nov},
number = {6},
pages = {1--37},
publisher = {ACM},
title = {{A Survey of Research into Mixed Criticality Systems}},
url = {http://dl.acm.org/citation.cfm?doid=3161158.3131347},
volume = {50},
year = {2017}
}
@inproceedings{Zhu2006,
abstract = {Recent studies show that, voltage scaling, which is an efficient energy management technique, has a direct and negative effect on system reliability because of the increased rate of transient faults (e.g., those induced by cosmic particles). In this work, we propose schemes that explore dynamic slack for energy savings while taking system reliability into consideration. The proposed schemes dynamically schedule an additional recovery to recuperate the reliability loss due to energy management. Based on the amount of available slack, the application size and the fault rate changes, we analyze when it is profitable to reclaim the slack for energy savings without sacrificing system reliability. Checkpoint technique is further explored to efficiently use the slack. Analytical and simulation results show that, the proposed reliability-aware energy management schemes can achieve comparable energy savings as ordinary energy management schemes while preserving system reliability. The ordinary energy management schemes that ignore the effects of voltage scaling on fault rate changes could lead to drastically decreased system reliability.},
author = {Zhu, Dakai},
booktitle = {Real-Time Technology and Applications - Proceedings},
doi = {10.1109/RTAS.2006.36},
isbn = {9780769525167},
issn = {10801812},
pages = {397--407},
publisher = {IEEE},
title = {{Reliability-aware dynamic energy management in dependable embedded real-time systems}},
url = {http://ieeexplore.ieee.org/document/1613353/},
year = {2006}
}
@article{Salehi2016a,
abstract = {This paper proposes an N-modular redundancy (NMR) technique with low energy-overhead for hard real-time multi-core systems. NMR is well-suited for multi-core platforms as they provide multiple processing units and low-overhead communication for voting. However, it can impose considerable energy overhead and hence its energy overhead must be controlled, which is the primary consideration of this paper. For this purpose the system operation can be divided into two phases: indispensable phase and on-demand phase. In the indispensable phase only half-plus-one copies for each task are executed. When no fault occurs during this phase, the results must be identical and hence the remaining copies are not required. Otherwise, the remaining copies must be executed in the on-demand phase to perform a complete majority voting. In this paper, for such a two-phase NMR, an energy-management technique is developed where two new concepts have been considered: i) Block-partitioned scheduling that enables parallel task execution during on-demand phase, thereby leaving more slack for energy saving, ii) Pseudo-dynamic slack, that results when a task has no faulty execution during the indispensable phase and hence the time which is reserved for its copies in the on-demand phase is reclaimed for energy saving. The energy-management technique has an off-line part that manages static and pseudo-dynamic slacks at design time and an online part that mainly manages dynamic slacks at run-time. Experimental results show that the proposed NMR technique provides up to 29 percent energy saving and is 6 orders of magnitude higher reliable as compared to a recent previous work.},
author = {Salehi, Mohammad and Ejlali, Alireza and Al-Hashimi, Bashir M.},
doi = {10.1109/TPDS.2015.2444402},
issn = {10459219},
journal = {IEEE Transactions on Parallel and Distributed Systems},
keywords = {Energy minimization,multi-core systems,real-time and embedded systems,reliability,scheduling},
month = {may},
number = {5},
pages = {1497--1510},
title = {{Two-Phase Low-Energy N-Modular Redundancy for Hard Real-Time Multi-Core Systems}},
url = {http://ieeexplore.ieee.org/document/7122343/},
volume = {27},
year = {2016}
}
@article{Coffman1972,
abstract = {Despite the recognized potential of multiprocessing little is known concerning the general problem of finding efficient algorithms which compute minimallength schedules for given computations and m≧2 processors. In this paper we formulate a general model of computation structures and exhibit an efficient algorithm for finding optimal nonpreemptive schedules for these structures on two-processor systems. We prove that the algorithm gives optimal solutions and discuss its application to preemptive scheduling disciplines.},
author = {Coffman, E. G. and Graham, R. L.},
doi = {10.1007/BF00288685},
issn = {00015903},
journal = {Acta Informatica},
number = {3},
pages = {200--213},
publisher = {Springer-Verlag},
title = {{Optimal scheduling for two-processor systems}},
url = {http://link.springer.com/10.1007/BF00288685},
volume = {1},
year = {1972}
}
@article{Huang2006,
abstract = {This paper presents HotSpot-a modeling methodology for developing compact thermal models based on the popular stacked-layer packaging scheme in modern very large-scale integration systems. In addition to modeling silicon and packaging layers, HotSpot includes a high-level on-chip interconnect self-heating power and thermal model such that the thermal impacts on interconnects can also be considered during early design stages. The HotSpot compact thermal modeling approach is especially well suited for preregister transfer level (RTL) and presynthesis thermal analysis and is able to provide detailed static and transient temperature information across the die and the package, as it is also computationally efficient.},
author = {Huang, Wei and Ghosh, Shougata and Velusamy, Siva and Sankaranarayanan, Karthik and Skadron, Kevin and Stan, Mircea R.},
doi = {10.1109/TVLSI.2006.876103},
issn = {10638210},
journal = {IEEE Transactions on Very Large Scale Integration (VLSI) Systems},
keywords = {Compact thermal model,Early design stages,Interconnect self-heating,Temperature,VLSI},
month = {may},
number = {5},
pages = {501--513},
title = {{HotSpot: A compact thermal modeling methodology for early-stage VLSI design}},
url = {http://ieeexplore.ieee.org/document/1650228/},
volume = {14},
year = {2006}
}
@inproceedings{Guo2011,
abstract = {The negative effects of the Dynamic Voltage and Frequency Scaling (DVFS) technique on the system reliability has recently promoted the research on reliability-aware power management (RAPM). RAPM aims at reducing the system energy consumption while preserving the system's reliability. In this paper, we study the RAPM problem for parallel realtime applications for shared memory multiprocessor systems in the presence of precedence constraints. We show that this problem is NP-hard. Depending on how recoveries are scheduled and utilized by a subset of selected tasks, we investigate both individual-recovery and shared-recovery based RAPM heuristics. Online RAPM schemes that exploit dynamic slack generated at runtime are also considered. The proposed schemes are evaluated through extensive simulations. The results show that all schemes can preserve system reliability under all settings. For modest system loads, similar energy savings are obtained by all static schemes. However, when the system load is low, the shared-recovery based schemes need coordinated recovery operations on all processors and thus save less energy. Moreover, by reclaiming dynamic slack, the online schemes yield better energy savings.},
author = {Guo, Yifeng and Zhu, Dakai and Aydin, Hakan},
booktitle = {2011 International Green Computing Conference and Workshops, IGCC 2011},
doi = {10.1109/IGCC.2011.6008562},
isbn = {9781457712203},
keywords = {DVFS,Dependent Tasks,Multiprocessor Real-Time Systems,Reliability,Transient Faults},
month = {jul},
pages = {1--8},
publisher = {IEEE},
title = {{Reliability-aware power management for parallel real-time applications with precedence constraints}},
url = {http://ieeexplore.ieee.org/document/6008562/},
year = {2011}
}
@inproceedings{Su2013a,
abstract = {The Elastic Mixed-Criticality (E-MC) task model and an Early-Release EDF (ER-EDF) scheduling algorithm have been studied to address the service interruption problem for low- criticality tasks in uniprocessor systems, where the minimum ser- vice requirements of low-criticality tasks are guaranteed by their maximum periods. In this paper, focusing on multicore systems, we first investigate and empirically evaluate the schedulability of E-MC tasks under partitioned-EDF (P-EDF) by considering various task-to-core mapping heuristics. Then, to improve the service levels of low-criticality tasks by exploiting slack at runtime, with and without task migrations being considered, we study both global and local early-release schemes. Moreover, considering varied migration overheads between different cores, we propose the multicore-aware and migration constrained global- ER schemes. The simulation results show that, compared to the state-of-the-art Global EDF-VD scheduler, P-EDF with various partitioning heuristics can lead to many more schedulable E-MC task sets. Moreover, our proposed global and local ER schemes can significantly improve the execution frequencies (and thus service levels) of low-criticality tasks, while Global EDF-VD may severely affect them by discarding most of their task instances at runtime (especially for systems with more cores). Furthermore, by allowing task migrations, global-ER schemes can dramatically improve low-criticality tasks' service levels for partitionings that do},
author = {Su, Hang and Zhu, Dakai and Mosse, Daniel},
booktitle = {2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2013},
doi = {10.1109/RTCSA.2013.6732239},
isbn = {9781479908509},
issn = {978-1-4799-0850-9},
month = {aug},
pages = {352--357},
publisher = {IEEE},
title = {{Scheduling algorithms for elastic mixed-criticality tasks in multicore systems}},
url = {http://ieeexplore.ieee.org/document/6732239/},
year = {2013}
}
@article{Munir2012,
abstract = {With Moore's law supplying billions of transistors on-chip, embedded systems are undergoing a transition from single-core to multicore to exploit this high-transistor density for high performance. Embedded systems differ from traditional high-performance supercomputers in that power is a first-order constraint for embedded systems; whereas, performance is the major benchmark for supercomputers. The increase in on-chip transistor density exacerbates power/thermal issues in embedded systems, which necessitates novel hardware/software power/thermal management techniques to meet the ever-increasing high-performance embedded computing demands in an energy-efficient manner. This paper outlines typical requirements of embedded applications and discusses state-of-the-art hardware/software high-performance energy-efficient embedded computing (HPEEC) techniques that help meeting these requirements. We also discuss modern multicore processors that leverage these HPEEC techniques to deliver high performance per watt. Finally, we present design challenges and future research directions for HPEEC system development. {\textcopyright} 2012 IEEE.},
author = {Munir, Arslan and Ranka, Sanjay and Gordon-Ross, Ann},
doi = {10.1109/TPDS.2011.214},
issn = {10459219},
journal = {IEEE Transactions on Parallel and Distributed Systems},
keywords = {High-performance computing (HPC),embedded systems,energy-efficient computing,green computing,low power,multicore},
month = {apr},
number = {4},
pages = {684--700},
title = {{High-performance energy-efficient multicore embedded computing}},
url = {http://ieeexplore.ieee.org/document/5963659/},
volume = {23},
year = {2012}
}
@article{Lee2012,
abstract = {For lightly loaded multicore processors that contain more processing cores than running tasks and have dynamic voltage and frequency scaling capability, we address the energy-efficient scheduling of periodic real-time tasks. First, we introduce two energy-saving techniques for the lightly loaded multicore processors: exploiting overabundant cores for executing a task in parallel with a lower frequency and turning off power of rarely used cores. Next, we verify that if the two introduced techniques are supported, then the problem of minimizing energy consumption of real-time tasks while meeting their deadlines is NP-hard on a lightly loaded multicore processor. Finally, we propose a polynomial-time scheduling scheme that provides a near minimum-energy feasible schedule. The difference of energy consumption between the provided schedule and the minimum-energy schedule is limited. The scheme saves up to 64 percent of the processing core energy consumed by the previous scheme that executes each task on a separate core.},
author = {Lee, Wan Yeon},
doi = {10.1109/TPDS.2011.87},
issn = {10459219},
journal = {IEEE Transactions on Parallel and Distributed Systems},
keywords = {Dynamic voltage and frequency scaling,Energy minimization,Multicore processor,Periodic real-time task,Scheduling},
month = {mar},
number = {3},
pages = {530--537},
title = {{Energy-efficient scheduling of periodic real-time tasks on lightly loaded multicore processors}},
url = {http://ieeexplore.ieee.org/document/5733343/},
volume = {23},
year = {2012}
}
@inproceedings{Henkel2013,
abstract = {As embedded on-chip systems grow more and more complex and are about to be deployed in automotive and other demanding application areas (beyond the main-stream of consumer electronics), run-time adaptation is a prime design consideration for many reasons: i) reliability is a major concern when migrating to technology nodes of 32nm and beyond, ii) efficiency i.e. computational power per Watt etc. is a challenge as computing models do not keep up with hardware-provided computing capabilities, iii) power densities increase rapidly as Dennard Scaling fails resulting in what is dubbed "Dark Silicon", iv) highly complex embedded applications are hard to predict etc. All these scenarios (and further not listed here) make proactive and sophisticated run-time adaption techniques a prime design consideration for generations of multi-core architectures to come. The intend of this paper is to present problems and solutions of top research initiatives from diverse angels with the common denominator of the dire need for run-time adaption: The first part tackles the thermal problem i.e. high power densities and the related short and long-term effects it has on the reliability and it presents scalable techniques to cope the related problems. The second section demonstrates the potential of steep slope devices on thread scheduling of multi-cores. The third approach presents embedded pipelined architectures running complex multi-media applications whereas the fourth section introduces the paradigm of invasive computing i.e. a novel computing approach promising high efficiency through a highly-adaptive hardware/software architecture. In summary, the paper presents snapshots on four highlyadaptive solutions and platforms from different angles for challenges of complex future multi-core systems. {\&}copy; 2013 IEEE.},
author = {Henkel, J{\"{o}}rg and Narayanan, Vijaykrishnan and Parameswaran, Sri and Teich, J{\"{u}}rgen},
booktitle = {2013 International Conference on Hardware/Software Codesign and System Synthesis, CODES+ISSS 2013},
doi = {10.1109/CODES-ISSS.2013.6659000},
isbn = {9781479914173},
month = {sep},
pages = {1--8},
publisher = {IEEE},
title = {{Run-time adaption for highly-complex multi-core systems}},
url = {http://ieeexplore.ieee.org/document/6659000/},
year = {2013}
}

@inproceedings{henkel2015new,
  title={New trends in dark silicon},
  author={Henkel, J{\"o}rg and Khdr, Heba and Pagani, Santiago and Shafique, Muhammad},
  booktitle={2015 52nd ACM/EDAC/IEEE Design Automation Conference (DAC)},
  pages={1--6},
  year={2015},
  organization={IEEE}
}

@article{binkert2011gem5,
	title={The gem5 simulator},
	author={Binkert, Nathan and Beckmann, Bradford and Black, Gabriel and Reinhardt, Steven K and Saidi, Ali and Basu, Arkaprava and Hestness, Joel and Hower, Derek R and Krishna, Tushar and Sardashti, Somayeh and others},
	journal={ACM SIGARCH Computer Architecture News},
	volume={39},
	number={2},
	pages={1--7},
	year={2011},
	publisher={ACM}
}

@inproceedings{li2009mcpat,
	title={McPAT: an integrated power, area, and timing modeling framework for multicore and manycore architectures},
	author={Li, Sheng and Ahn, Jung Ho and Strong, Richard D and Brockman, Jay B and Tullsen, Dean M and Jouppi, Norman P},
	booktitle={Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture},
	pages={469--480},
	year={2009},
	organization={ACM}
}

@article{huang2006hotspot,
	title={HotSpot: A compact thermal modeling methodology for early-stage VLSI design},
	author={Huang, Wei and Ghosh, Shougata and Velusamy, Sivakumar and Sankaranarayanan, Karthik and Skadron, Kevin and Stan, Mircea R},
	journal={IEEE Transactions on Very Large Scale Integration (VLSI) Systems},
	volume={14},
	number={5},
	pages={501--513},
	year={2006},
	publisher={IEEE}
}

@inproceedings{guthaus2001mibench,
	title={MiBench: A free, commercially representative embedded benchmark suite},
	author={Guthaus, Matthew R and Ringenberg, Jeffrey S and Ernst, Dan and Austin, Todd M and Mudge, Trevor and Brown, Richard B},
	booktitle={Proceedings of the Fourth Annual IEEE International Workshop on Workload Characterization. WWC-4 (Cat. No. 01EX538)},
	pages={3--14},
	year={2001},
	organization={IEEE}
}

repository: porya-gohary/SeminarTemplate

repo_name: porya-gohary/SeminarTemplate


text:
@InProceedings{kar13,
  pdf = {http://jmlr.org/proceedings/papers/v28/kar13.pdf},
  supplementary = {Supplementary:kar13-supp.pdf},
  number = {3},
  section = {cycle-3},
  title = {On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions},
  author = {Kar, Purushottam and Sriperumbudur, Bharath and Jain, Prateek and Karnick, Harish},
  pages = {441-449},
  abstract = {In this paper, we study the generalization properties of online learning based stochastic methods for supervised learning problems where the loss function is dependent on more than one training sample (e.g., metric learning, ranking). We present a generic decoupling technique that enables us to provide Rademacher complexity-based generalization error bounds. Our bounds are in general tighter than those obtained by Wang et al. (COLT 2012) for the same problem. Using our decoupling technique, we are further able to obtain fast convergence rates for strongly con-vex pairwise loss functions. We are also able to analyze a class of memory efficient on-line learning algorithms for pairwise learning problems that use only a bounded subset of past training samples to update the hypothesis at each step. Finally, in order to complement our generalization bounds, we propose a novel memory efficient online learning algorithm for higher order learning problems with bounded regret guarantees.},
}

license: MIT

repository: mreid/papersite

license_type: permissive

repo_name: mreid/papersite

branch_name: refs/heads/master

gha_license_id: MIT

gha_language: TeX

extension: bib


text:
SUMMARY = "Phosphor OpenBMC machine readable workbook API modules"
DESCRIPTION = "The API for the MRW XML generated by the Serverwiz tool"
LICENSE = "Apache-2.0"
LIC_FILES_CHKSUM = "file://LICENSE;md5=d2794c0df5b907fdace235a619d80314"
DEPENDS += "libxml-simple-perl-native libjson-perl-native"
SRCREV = "${MRW_API_SRCREV}"
PR = "r1"

SRC_URI += "${MRW_API_SRC_URI}"

S = "${WORKDIR}/git"

inherit cpan-base
inherit mrw-rev
inherit perlnative
inherit native

do_install() {
    perl_version="${@get_perl_version(d)}"
    install -d ${D}${PERLLIBDIRS:class-native}/site_perl/${perl_version}/mrw
    install -m 0755 scripts/Targets.pm ${D}${PERLLIBDIRS:class-native}/site_perl/${perl_version}/mrw/Targets.pm
}

repository: openbmc/openbmc

repo_name: openbmc/openbmc

gha_license_id: NOASSERTION

gha_language: Python

extension: bb


text:
@charset "utf-8";
/* CSS Document */

body{margin:0;padding:0;background-color:#fff;font-family:Arial, Helvetica, sans-serif,sans-serif;color:#666;}
ul{list-style:none;padding:0;margin:0;}

.topbar-wrapper{width:100%;background-color:#d31b59;
 filter:progid:DXImageTransform.Microsoft.gradient(GradientType=1,startColorstr=#d31b59, endColorstr=#962577);
 background-image:-moz-linear-gradient(left, #d31b59 42%, #962577 88%);
 background-image:-webkit-linear-gradient(left, #d31b59 42%, #962577 88%);
 background-image:-ms-linear-gradient(left, #d31b59 42%, #962577 88%);
 background-image:linear-gradient(left, #d31b59 42%, #962577 88%);
 background-image:-o-linear-gradient(left, #d31b59 42%, #962577 88%);
 background-image:-webkit-gradient(linear, left bottom, right bottom, color-stop(42%,#d31b59), color-stop(88%,#962577))z-index:199;}
.logo{height:99px;}
.logo img{height:99px;}
.body-area{background-color:#f1f1f1;width:100%;}
.content-area{padding-left:10px; padding-right:10px;}
.content-area>.row{margin-left:-10px; margin-right:-10px}

.card{width:100%;border-radius:3px;margin-bottom:15px;overflow:hidden;padding:15px 0;background:#fff;box-shadow:1px 2px 3px 1px #ccc;transition:all ease-in .1s}
.card:hover{box-shadow:3px 3px 6px 1px #ccc; transition:all ease-in .1s}
.card-block-info{width:100%;padding:10px 15px;position:relative;overflow:hidden;}
.card .card-block-info{padding:0 10px}

.card-block-left{width:40%; margin-top:-10px; padding: 0 10px 0 20px; float:left;}
.card-block-middle{float:left;margin-top:-10px;}
.card-block-right{float:left;margin-top:-10px; padding-left:30px}

.card-block-middle ul li {float:left; padding:5px 15px 5px 0;}
.card-block-right ul li {float:left; padding:30px 15px 5px 0;}

.prfl-pic{width:60px; height:60px; border-radius:100%;overflow: hidden; float:left;}
.prfl-pic img{width:100%;}
.search-section{ text-align:center;padding:40px 0px 0px 0px;}
.alphabet-search-section{ text-align:center;padding:40px 0px 40px 0px;}
.card-icon{width:40px;height:36px;display:inline-block;background:url(../images/icon.png) no-repeat; position:relative; top:8px}

.profile-icon{background-position:0px -3px;}
.report-icon{background-position:-56px -3px;}
.document-icon{background-position:-116px -3px;}
.sms-icon{background-position:0px -56px;}
.mail-icon{background-position:-56px -56px;}
.mobile-icon{background-position:-116px -56px;}
.calendar-icon{background-position:-165px -27px;}

.popup-bg{width:100%;height:100%;background:rgba(0,0,0,0.7);z-index:9999;top:0;position:fixed;display:none;}
.popup-content-holder{width:100%;text-align:center;display:flex;align-items:center;height:100%;flex-direction:row;padding:10px 10px;overflow:auto;}
.popup-container{background-color:#fff;border-radius:3px;padding-top:0;padding-bottom:0;padding-left:0;padding-right:0;text-align:left;margin:0 auto;overflow:auto;max-height:100%;min-height:200px;}

.btn-letter{background-color:transparent; border:0px solid #F00; font-size:16px;  padding:3px 10px; }
.btn-letter:hover{background-color:#F00; border:0px solid #F00; border-radius:3px; color:#FFF}
.active{background-color:#F00; border:0px solid #F00; border-radius:3px;color:#FFF}

.search-field input[type=text]{width:50%; border:1px solid #F00; border-radius:3px; padding:10px 5px;}

.btn-add-patient{background-color:#F00; border:1px solid #F00; border-radius:5px; padding:10px 10px; color:#FFF;text-transform:uppercase;}
.search-field span{padding:5px 20px;}
@media (max-width:1024px){
	.card-block-left {
		width: 42%;
		padding: 0 10px 0 10px;
	}
	.card-block-right {
    	padding-left: 10px;
	}
	.card-block-middle ul li {float:left; padding:5px 5px 5px 0;}
	.card-block-right ul li {float:left; padding:30px 5px 5px 0;}

}
@media (max-width:414px){
	.card-block-left{width:75%;}
	.search-field input[type=text]{width:40%;}
	.logo{height:50px;}
	.logo img{height:50px;}
}

repository: tonmoy-sardar/careclues

repo_name: tonmoy-sardar/careclues

extension: css


text:
@proceedings{CM19,
author={Chakraborty, Sourav and  Meel, Kuldeep S.},
title={On testing of Uniform Samplers},
booktitle={Proceedings of AAAI Conference on Artificial Intelligence (AAAI)},
month={1},
year={2019},
abstract={Recent years have seen an unprecedented adoption of artificial intelligence in wide variety of applications ranging from medical diagnosis, automobile, security to aircraft collision avoidance. Probabilistic reasoning is a key component of such modern artificial intelligence systems. Sampling techniques form the core of the state of the art probabilistic reasoning systems. In contrast to testing for deterministic programs, where one trace is sufficient to prove the existence of a bug; such is not the case for samplers as one sample is typically not sufficient to prove non-conformity of the sampler to the desired distribution. This makes one wonder: whether it is possible to design testing methodology to test whether a sampler under test generates samples close to a given distribution. The primary contribution of this paper is a positive answer to the above question: We design, to the best of our knowledge, the first algorithmic framework, Barbarik, to test whether the distribution generated by $\varepsilon-$close or $\eta-$far from the uniform distribution. In contrast to the sampling techniques that require an exponential or sub-exponential number of samples for sampler whose support can be represented by $n$ bits, Barbarik requires only $\mathcal{O}(1/(\eta-\varepsilon)^2)$ samples. We present a prototype implementation of Barbarik and use it to test three state of the art uniform samplers over the support defined by combinatorial constraints. Barbarik is able to provide a certificate of uniformity to one sampler and demonstrate non-uniformity for the other two samplers.},
}

repository: meelgroup/meelgroup-website

repo_name: meelgroup/meelgroup-website


text:
@article{Agrawal:2019dlm,
 archiveprefix = {arXiv},
 author = {Agrawal, Prateek and Obied, Georges and Vafa, Cumrun},
 eprint = {1906.08261},
 month = {6},
 primaryclass = {astro-ph.CO},
 title = {$H_0$ Tension, Swampland Conjectures and the Epoch of Fading Dark Matter},
 year = {2019}
}

repository: prateekagrawal/academic-kickstart

repo_name: prateekagrawal/academic-kickstart


text:
@article{RN47,
 author = {Morran, D. C. and Wu, J. and Jamieson, N. B. and Mrowinska, A. and Kalna, G. and Karim, S. A. and Au, A. Y. and Scarlett, C. J. and Chang, D. K. and Pajak, M. Z. and Oien, K. A. and McKay, C. J. and Carter, C. R. and Gillen, G. and Champion, S. and Pimlott, S. L. and Anderson, K. I. and Evans, T. R. and Grimmond, S. M. and Biankin, A. V. and Sansom, O. J. and Morton, J. P.},
 doi = {10.1136/gutjnl-2013-306202},
 issn = {1468-3288 (Electronic)
0017-5749 (Linking)},
 journal = {Gut},
 number = {9},
 pages = {1481-9},
 title = {Targeting mTOR dependency in pancreatic cancer},
 type = {Journal Article},
 url = {http://www.ncbi.nlm.nih.gov/pubmed/24717934
http://gut.bmj.com/content/63/9/1481.full.pdf},
 volume = {63},
 year = {2014}
}

repository: laoshancai/ccb-home

repo_name: laoshancai/ccb-home