{"title":"Ada 95 eliminates race conditions","authors":"J. Barnes","doi":"10.1109/WPDRTS.1995.470513","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470513","url":null,"abstract":"This brief paper raises the issue of whether Ada 95 gives full control of queuing when required. Ada 83 prevented the programmer from having detailed control and inadvertently introduced nasty race conditions. The only solution in Ada 83 was to abandon Ada tasking and use low level primitives such as semaphores. Ada 95 includes a number of new features such as the requeue statement, explicit priority control, queuing policy pragmas, access to task identities and facilities for synchronous and asynchronous task control. Do these fully resolve the issues?.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122602907","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":"Bounding the end-to-end response time in multiprocessor real-time systems","authors":"Jun Sun, J.W.-S. Liu","doi":"10.1109/WPDRTS.1995.470502","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470502","url":null,"abstract":"In a multiprocessor real-time system, a task may execute in turn on several processors before it completes. The task may have different priorities on different processors and may execute on some processors more than once. Existing techniques for bounding the response times of such tasks are not effective. In this paper, we present a method to compute tighter upper bounds on their response times.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132821297","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":"Distributed real-time computing","authors":"J. Stankovic","doi":"10.1109/WPDRTS.1995.470515","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470515","url":null,"abstract":"This paper outlines the key areas of research in distributed real-time systems that are being investigated within the Spring Project at the University of Massachusetts. This includes reflective, multiprocessor operating systems, dynamic guarantees, adaptive flow, control filters, adaptive fault tolerance, architecture support, and active real-time databases.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131794239","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":"On the modeling of distributed real-time systems","authors":"D. Hammer","doi":"10.1109/WPDRTS.1995.470516","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470516","url":null,"abstract":"This paper discusses the requirements for the modeling of distributed real-time systems, both from an engineering and a reengineering point of view. A suitable extension of the object-oriented paradigm with execution graphs, modeled as partial orders, is briefly described. The objects and execution graphs are attended with annotations suitable for the description of non-fictional system properties such as timing and reliability. In addition, the requirements for a tool-set that supports such a methodology is given.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133808834","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":"Runtime reallocation of divisible load under processor execution deadlines","authors":"E. Haddad","doi":"10.1109/WPDRTS.1995.470510","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470510","url":null,"abstract":"We examine the problem of optimizing the reallocation and execution of divisible load originating in different amounts at the sites of an interconnected set of heterogeneous processors characterized by their load computing speeds and I/O speeds. Each processor imposes, a priori, a hard deadline on its allocated task completion. The objective of load retasking and redistribution, which is implemented at runtime, is twofold: to prescribe feasible load allocations, and to minimize the job execution completion time. We present the necessary and sufficient conditions for the existence of feasible reallocations, and for a feasible reallocation to be optimal in the sense of minimum completion time. When task completions of an optimal reallocation occur before the specified processor deadlines, the deadlines can be advanced by the amount of laxity to obtain the tightest deadlines.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"9 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123312173","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":"Partitioning Ada programs for distributed platforms","authors":"B. Ravindran","doi":"10.1109/WPDRTS.1995.470509","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470509","url":null,"abstract":"Few work has been done in the past which has dealt with programming for loosely coupled distributed systems. However, distributed execution is becoming increasingly important for real time systems, since most of them are implemented with distributed processors. Programming multiprocessors through a single program approach offers many advantages from a software engineering point of view like, abstract data types, separate compilation etc. However, few systems currently exist which allow programmers to develop software for distributed platforms through a single program, in a transparent fashion. In this context, Ada assumes great importance as, the Ada Language Reference Manual indicates that distributed execution was one of the goals of the designers. One of the most important attempts towards a distributed Ada system has been that of D. Cornhill (1984), in defining an Ada Program Partitioning Language (APPL). This system facilitates a distributed execution of Ada programs among a set of processors with a wide range of granularity. However in specific the distributable units of an Ada program using the constructs of APPL in an automatic fashion no attempt has been done in the past. Our goal has been towards developing a Ada Program Partitioning Tool to generate a distribution specification in a completely automated manner. A high level design of the tool is shown. We describe the techniques developed and the results obtained in subsequent sections.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132112993","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 computing cornerstones: a system engineer's view","authors":"M. W. Masters","doi":"10.1109/WPDRTS.1995.470514","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470514","url":null,"abstract":"Common attributes are found in both military and commercial real-time systems. The existence of these common threads suggests that there may be key quantitative system design considerations that undergird large scale, real-time system design. Identifying and quantifying these key aspects early in a program is important in insuring the success of a design. This paper suggests a candidate list of such computing properties, or cornerstones, by which every real-time system is defined and constrained.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129321190","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":"Towards distributed objects for real-time systems","authors":"A. Gargaro","doi":"10.1109/WPDRTS.1995.470519","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470519","url":null,"abstract":"This paper illustrates that several of the new features specified in the revised Ada standard facilitate programming real-time distributed/parallel applications. In particular, the Ada Distributed Systems Annex supports both statically bound and the more object-oriented dynamically bound remote procedure calls. These features are used to implement a paradigm for composing asynchronous remote procedure calls when both input and output parameters are required. The paradigm is based upon the notion of a distributed object through which the output parameters may be returned without blocking the execution of the caller. Such paradigms, when combined with the enhanced features for concurrency and data synchronization, suggest that Ada will contribute towards understanding some of the issues relevant to developing efficient implementations of distributed objects to support the next generation of real time systems.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128922072","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":"Avoiding deadline decay under transient overloads","authors":"B. R. Swim, M. Tayli, M. Benmaiza, M. Woodward","doi":"10.1109/WPDRTS.1995.470486","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470486","url":null,"abstract":"Deadline scheduling policies based on stochastic computation times perform well in average but fail in presence of transient overloads, causing already scheduled tasks to miss their deadline. This paper presents an approach using medium-term scheduling policies to cope with the problem of transient overload in dynamic real-time systems. The proposed approach has been implemented in a Real-Time Distributed Operating System (RTDOS) running on a Transputer network.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121545108","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":"Optimized priority assignment for tasks and messages in distributed hard real-time systems","authors":"J. Javier Gutiérrez, M. G. Harbour","doi":"10.1109/WPDRTS.1995.470498","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470498","url":null,"abstract":"Recent advances in the analysis of distributed realtime systems have made it possible to predict if hard realtime requirements will be met. However, it is still difficult to find a feasible priority assignment when the utilization levels of the CPUs and communication networks are pushed near to their limits. This paper presents a new heuristic algorithm for optimizing the assignment of priorities to tasks and messages in distributed hard realtime systems. The algorithm is based on the knowledge of the parameters that influence the worst-case response time of a distributed application. This algorithm is compared to simulated annealing, which is a general optimization technique for discrete functions that had been previously used for solving similar problems. On average, our heuristic algorithm executes two orders of magnitude faster than simulated annealing, finds better solutions, and finds solutions in cases where the latter method fails.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128464059","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}