{"title":"Dual face phased array radar scheduling with multiple constraints","authors":"Q. Cao, J. Stankovic","doi":"10.1145/1086228.1086293","DOIUrl":"https://doi.org/10.1145/1086228.1086293","url":null,"abstract":"Tasks in many real-time applications can be scheduled by variations of rate monotonic or earliest deadline first algorithms. When this is possible, it is satisfying to have formal analysis and performance bounds underlying the use of these algorithms. However, in many applications the simultaneous set of constraints that must be satisfied makes these traditional solutions unsuitable. Practical solutions for these more complicated applications are important. In this paper we develop a novel integrated scheduling and allocation heuristic for a dual face phased array radar system. The realistic features of the radar system that must be simultaneously addressed include timeliness (worst case execution time, period, deadline), semantic importance, and physical constraints such as beam selection and frequency harmonics. The heuristic function we develop provides a very flexible way to incorporate these requirements into one single equation. Since scheduling high semantic importance tasks is paramount, we use the highest semantic importance tasks' success ratio as the major performance metric. Based on simulation results, we show that our static heuristic algorithm can schedule more than 91% of the highest semantic importance tasks at high frequency conflict degree even at heavy workloads. The result is 50% better than EDF and 31% better than an importance (IMP) based static priority scheduling algorithm where IMP is similar to various current approaches. For the online scheduling algorithm, our heuristic algorithm is 30% better than EDF and 20% better than IMP in terms of highest semantic importance tasks' success ratio at heavy workloads.","PeriodicalId":284648,"journal":{"name":"Proceedings of the 5th ACM international conference on Embedded software","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115974742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Cong Liu, A. Kondratyev, Yosinori Watanabe, A. Sangiovanni-Vincentelli
{"title":"A structural approach to quasi-static schedulability analysis of communicating concurrent programs","authors":"Cong Liu, A. Kondratyev, Yosinori Watanabe, A. Sangiovanni-Vincentelli","doi":"10.1145/1086228.1086231","DOIUrl":"https://doi.org/10.1145/1086228.1086231","url":null,"abstract":"We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an intermediate model of the system. However, Petri nets generated from many interesting applications are not schedulable. In this paper, we show the underlying mechanism which causes unschedulability in terms of the structure of a Petri net. We introduce a Petri net structural property and prove unschedulability if the property holds. We propose a linear programming based algorithm to check the property, and prove the algorithm is valid. Our approach prove unschedulability typically within a second for Petri nets generated from industrial JPEG and MPEG codecs, while the scheduler fails to terminate within 24 hours.","PeriodicalId":284648,"journal":{"name":"Proceedings of the 5th ACM international conference on Embedded software","volume":"445 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125768319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"From multi-clocked synchronous processes to latency-insensitive modules","authors":"J. Talpin, D. Potop-Butucaru, J. Ouy, B. Caillaud","doi":"10.1145/1086228.1086279","DOIUrl":"https://doi.org/10.1145/1086228.1086279","url":null,"abstract":"We consider the problem of synthesizing correct-by-construction globally asynchronous, locally synchronous (GALS) implementations from modular synchronous specifications. This involves the synthesis of asynchronous wrappers that drive the synchronous clocks of the modules and perform input reading in such a fashion as to preserve, in a certain sense, the global properties of the system. Our approach is based on the theory of weakly endochronous systems, which gives criteria guaranteeing the existence of simple and efficient asynchronous wrappers. We focus on the transformation (by means of added signalling) of the synchronous modules of a multiclock synchronous specification into weakly endochronous modules, for which simple and efficient wrappers exist.","PeriodicalId":284648,"journal":{"name":"Proceedings of the 5th ACM international conference on Embedded software","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116798256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Real-time interfaces for interface-based design of real-time systems with fixed priority scheduling","authors":"E. Wandeler, L. Thiele","doi":"10.1145/1086228.1086246","DOIUrl":"https://doi.org/10.1145/1086228.1086246","url":null,"abstract":"The central idea behind interface-based design is to describe components by a component interface. In contrast to a component description that describes what a component does, a component interface describes how a component can be used. A well designed component interface provides enough information to decide whether two or more components can work together properly in a system. In this work, we expand the idea of interface-based design to the area of real-time system design. Here, the term of 'working together properly' refers to questions like: Does the composed system satisfy all requested real-time properties such as delay and throughput constraints? For this, we introduce Real-Time Interfaces, that connect the principles of Real-Time Calculus with Interface-based Design. In contrast to traditional real-time system design, in interface-based real-time system design the compliance to real-time constraints is checked at composition time. This leads to faster design processes and partly removes the need for the classical binary search approach to find an economically dimensioned system. Further, interface-based real-time system design also benefits from the properties of incremental design and independent implementability.","PeriodicalId":284648,"journal":{"name":"Proceedings of the 5th ACM international conference on Embedded software","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114890737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proceedings of the 5th ACM international conference on Embedded software","authors":"","doi":"10.1145/1086228","DOIUrl":"https://doi.org/10.1145/1086228","url":null,"abstract":"","PeriodicalId":284648,"journal":{"name":"Proceedings of the 5th ACM international conference on Embedded software","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124998722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}