The authors describe a heuristic for dynamically scheduling time-constrained tasks in a distributed environment. When a task is submitted to a node, the scheduling software tries to schedule the task locally so as to meet its deadline. If that is not feasible, it tries to locate another node where this could be done with a high probability of success. Nodes in the system inform each other about their state (vis-a-vis the availability of free cycles) using a combination of broadcasting and gossiping. The performance of the proposed protocol is evaluated both analytically and via simulation. Based on these findings, they argue that keeping a diverse availability profile and using passive bidding (through gossiping) are both advantageous to distributed scheduling for real-time systems.<>
{"title":"Probabilistic job scheduling for distributed real-time applications","authors":"Azer Bestavros, D. Spartiotis","doi":"10.1109/RTA.1993.263108","DOIUrl":"https://doi.org/10.1109/RTA.1993.263108","url":null,"abstract":"The authors describe a heuristic for dynamically scheduling time-constrained tasks in a distributed environment. When a task is submitted to a node, the scheduling software tries to schedule the task locally so as to meet its deadline. If that is not feasible, it tries to locate another node where this could be done with a high probability of success. Nodes in the system inform each other about their state (vis-a-vis the availability of free cycles) using a combination of broadcasting and gossiping. The performance of the proposed protocol is evaluated both analytically and via simulation. Based on these findings, they argue that keeping a diverse availability profile and using passive bidding (through gossiping) are both advantageous to distributed scheduling for real-time systems.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117219637","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}
The paper describes the Media Exchange (MX) system, a generic distributed platform that supports specialized mission-critical applications for multi-media communications (voice, data, video, and telemetry). It describes the goals and strategies used to implement the platform and initial application set in the financial market domain, and discusses several areas for improvement. It concludes that the focus on change-tolerance provides the necessary ease of extension and design flexibility to support system enhancements and new applications for many years to come.<>
{"title":"MX: a real-time fault and change-tolerant distributed system","authors":"N. Olsen","doi":"10.1109/RTA.1993.263089","DOIUrl":"https://doi.org/10.1109/RTA.1993.263089","url":null,"abstract":"The paper describes the Media Exchange (MX) system, a generic distributed platform that supports specialized mission-critical applications for multi-media communications (voice, data, video, and telemetry). It describes the goals and strategies used to implement the platform and initial application set in the financial market domain, and discusses several areas for improvement. It concludes that the focus on change-tolerance provides the necessary ease of extension and design flexibility to support system enhancements and new applications for many years to come.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123488433","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}
In contrast to most of the other studies which only consider selected topic(s) and typically deal with issues of higher levels of design, the research project outlined uses a holistic approach to real-time application design issues. It is set up in layers starting with a predictably behaving computer hardware architecture, followed by an appropriate programming language and, finally, a tool for automated application development. Each of these layers provides a sound basis for the next. For the hardware layer, an asymmetrical parallel architecture is proposed and guidelines for its implementation are given. For the software layer, programming issues are dealt with. A real-time programming language concept is briefly described. Inside the compiler, an analyser is integrated, combining conventional and novel approaches for execution time estimation. Finally, the desired properties of a computer aided hard real-time application design and evaluation tool are enumerated.<>
{"title":"Design of embedded hard real-time applications with predictable behaviour","authors":"M. Colnaric, D. Verber, W. Halang","doi":"10.1109/RTA.1993.263088","DOIUrl":"https://doi.org/10.1109/RTA.1993.263088","url":null,"abstract":"In contrast to most of the other studies which only consider selected topic(s) and typically deal with issues of higher levels of design, the research project outlined uses a holistic approach to real-time application design issues. It is set up in layers starting with a predictably behaving computer hardware architecture, followed by an appropriate programming language and, finally, a tool for automated application development. Each of these layers provides a sound basis for the next. For the hardware layer, an asymmetrical parallel architecture is proposed and guidelines for its implementation are given. For the software layer, programming issues are dealt with. A real-time programming language concept is briefly described. Inside the compiler, an analyser is integrated, combining conventional and novel approaches for execution time estimation. Finally, the desired properties of a computer aided hard real-time application design and evaluation tool are enumerated.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129426106","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}
The author describes the design of a host/target multiprocessor system with distributed memory, which addresses a class of real-time problems that operate in a synchronized environment with rapid response to external events, such as real-time simulators and trainers. The unique needs of trainers and simulators are addressed through the implementation of a mirror memory and a distributed database supported by broadcasting writes and interrupts in a tightly-coupled host/target architecture. A special software development tool has been developed, referred to as the Application Worksheet, which provides real-time deadline scheduling and inter-processor triggering required in most simulator and trainer applications.<>
{"title":"The design of a real-time system for simulators and trainers","authors":"B. Furht","doi":"10.1109/RTA.1993.263123","DOIUrl":"https://doi.org/10.1109/RTA.1993.263123","url":null,"abstract":"The author describes the design of a host/target multiprocessor system with distributed memory, which addresses a class of real-time problems that operate in a synchronized environment with rapid response to external events, such as real-time simulators and trainers. The unique needs of trainers and simulators are addressed through the implementation of a mirror memory and a distributed database supported by broadcasting writes and interrupts in a tightly-coupled host/target architecture. A special software development tool has been developed, referred to as the Application Worksheet, which provides real-time deadline scheduling and inter-processor triggering required in most simulator and trainer applications.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121830115","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}
The author studies the start and completion times of application tasks on RTEM system, a descendant of MAFT developed at AlliedSignal. The RTEM workload consists of a set of periodic tasks, each of which is executed redundantly on the system for fault-tolerance. A priority based nonpreemptive list scheduling algorithm is used for task scheduling. The distributed agreement mechanism used to ensure fault-tolerance adds a nonzero, constant delay to the possible start of the tasks immediately succeeding the task being terminated. Since task execution times may vary between their maximum and minimum values, the start (and thus the completion) time of each copy of a task is difficult to predict unless the task execution order is fixed. He derives both lower and upper bounds of the start time for each task when all tasks are of the same periods, each node executes the entire task set, no branch conditions are allowed, and the task execution order need not be fixed.<>
{"title":"Bounds of start and completion times of application tasks on the RTEM system","authors":"Dar-Tzen Peng","doi":"10.1109/RTA.1993.263116","DOIUrl":"https://doi.org/10.1109/RTA.1993.263116","url":null,"abstract":"The author studies the start and completion times of application tasks on RTEM system, a descendant of MAFT developed at AlliedSignal. The RTEM workload consists of a set of periodic tasks, each of which is executed redundantly on the system for fault-tolerance. A priority based nonpreemptive list scheduling algorithm is used for task scheduling. The distributed agreement mechanism used to ensure fault-tolerance adds a nonzero, constant delay to the possible start of the tasks immediately succeeding the task being terminated. Since task execution times may vary between their maximum and minimum values, the start (and thus the completion) time of each copy of a task is difficult to predict unless the task execution order is fixed. He derives both lower and upper bounds of the start time for each task when all tasks are of the same periods, each node executes the entire task set, no branch conditions are allowed, and the task execution order need not be fixed.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117343287","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}
Todays' real-time systems become ever more complex and multiprocessor hardware starts pervading many types of equipment. This complexity indicates that real-time programming has matured into a true software engineering discipline which demands the appropriate set of tools for the support of the entire system lifecycle. Since studies show that debugging takes about half of the development time it is obvious that powerful debuggers are needed. The characteristics of real-time systems impose specific requirements on the debugger. The system must be capable of detecting logical as well as timing errors and the invasive nature of the debugging system must not alter the temporal logic of the application. The authors describe the design and the implementation of a debugger for a tightly coupled multiprocessor real-time system which complies with those specific requirements. The paper emphasizes on the high level tools which are necessary for the analysis and the interpretation of the trace data which has been collected at runtime. Those tools are necessary due to the high amounts of trace data being collected.<>
{"title":"A knowledge-based approach for the debugging of real-time multiprocessor systems","authors":"M. Timmerman, F. Gielen, P. Lambrix","doi":"10.1109/RTA.1993.263122","DOIUrl":"https://doi.org/10.1109/RTA.1993.263122","url":null,"abstract":"Todays' real-time systems become ever more complex and multiprocessor hardware starts pervading many types of equipment. This complexity indicates that real-time programming has matured into a true software engineering discipline which demands the appropriate set of tools for the support of the entire system lifecycle. Since studies show that debugging takes about half of the development time it is obvious that powerful debuggers are needed. The characteristics of real-time systems impose specific requirements on the debugger. The system must be capable of detecting logical as well as timing errors and the invasive nature of the debugging system must not alter the temporal logic of the application. The authors describe the design and the implementation of a debugger for a tightly coupled multiprocessor real-time system which complies with those specific requirements. The paper emphasizes on the high level tools which are necessary for the analysis and the interpretation of the trace data which has been collected at runtime. Those tools are necessary due to the high amounts of trace data being collected.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133632897","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}
Gives an overview of the field of real-time data acquisition in high-energy physics experiments. It presents the problems encountered in real-time data acquisition and describes current solutions to some of them. It is intended as a tutorial introduction, having the main purpose to educate non-physicists about the challenges met by the designers of computer systems for supercolliders, the largest scientific instruments ever built by humans.<>
{"title":"Real-time data acquisition in high-energy physics experiments","authors":"J. Zalewski","doi":"10.1109/RTA.1993.263105","DOIUrl":"https://doi.org/10.1109/RTA.1993.263105","url":null,"abstract":"Gives an overview of the field of real-time data acquisition in high-energy physics experiments. It presents the problems encountered in real-time data acquisition and describes current solutions to some of them. It is intended as a tutorial introduction, having the main purpose to educate non-physicists about the challenges met by the designers of computer systems for supercolliders, the largest scientific instruments ever built by humans.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132585033","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}
The author discusses the characteristics of the real-time scheduling technology for adaptive applications that have shared physical resources.<>
讨论了共享物理资源的自适应应用实时调度技术的特点。
{"title":"Resource scheduling for adaptive systems","authors":"E. E. Ferguson","doi":"10.1109/RTA.1993.263107","DOIUrl":"https://doi.org/10.1109/RTA.1993.263107","url":null,"abstract":"The author discusses the characteristics of the real-time scheduling technology for adaptive applications that have shared physical resources.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125398213","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}
Multimedia applications are becoming pervasive and are expected to be used in advanced process control systems where image data is related to higher order material qualities. The authors have analyzed real-time control applications and their needs. A necessary component to support such a distributed multimedia integrated control system is the need for network services that support both the real-time needs of control as well as the control traffic. The analysis shows that the primary network services must include support for network scheduling for multilevel priority traffic and for synchronization of remote data transmissions and stream multimedia traffic. They propose an asynchronous transfer mode (ATM)-based network architecture that uses a new real-time control protocol to provide these services.<>
{"title":"Multimedia-integrated real-time control systems","authors":"A. Guha, M. Agrawal, R.R. Rundquist","doi":"10.1109/RTA.1993.263121","DOIUrl":"https://doi.org/10.1109/RTA.1993.263121","url":null,"abstract":"Multimedia applications are becoming pervasive and are expected to be used in advanced process control systems where image data is related to higher order material qualities. The authors have analyzed real-time control applications and their needs. A necessary component to support such a distributed multimedia integrated control system is the need for network services that support both the real-time needs of control as well as the control traffic. The analysis shows that the primary network services must include support for network scheduling for multilevel priority traffic and for synchronization of remote data transmissions and stream multimedia traffic. They propose an asynchronous transfer mode (ATM)-based network architecture that uses a new real-time control protocol to provide these services.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131499904","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}
The Advanced Field Artillery Tactical Data System (AFATDS) is a multiserver automated command and control system for fire support operations. The authors applied rate-monotonic analysis to Version 1 of the software. They developed two models. The first model focuses exclusively on application-level tasks; the second model considers effects of the UNIX run-time system. Analysis of these models gives an early indication that the software will satisfy its timing requirements.<>
{"title":"Rate-monotonic analysis of an advanced field artillery data system","authors":"D. Thuente, R. Sedlmeyer","doi":"10.1109/RTA.1993.263109","DOIUrl":"https://doi.org/10.1109/RTA.1993.263109","url":null,"abstract":"The Advanced Field Artillery Tactical Data System (AFATDS) is a multiserver automated command and control system for fire support operations. The authors applied rate-monotonic analysis to Version 1 of the software. They developed two models. The first model focuses exclusively on application-level tasks; the second model considers effects of the UNIX run-time system. Analysis of these models gives an early indication that the software will satisfy its timing requirements.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125007605","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：