Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems最新文献

Real-time multimedia network system using VLIW hardware stack processor 实时多媒体网络系统采用VLIW硬件栈处理器

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems Pub Date : 1995-04-25 DOI: 10.1109/WPDRTS.1995.470503

T. Ae, K. Nishimura, R. Aibara, K. Sakai, K. Nakamura

引用次数: 5

The peer tasking design method 同伴任务设计方法

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems Pub Date : 1995-04-25 DOI: 10.1109/WPDRTS.1995.470511

N. Howes, Jonathan D. Wood, A. Goforth

{"title":"The peer tasking design method","authors":"N. Howes, Jonathan D. Wood, A. Goforth","doi":"10.1109/WPDRTS.1995.470511","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470511","url":null,"abstract":"This paper is a preliminary report of an ARPA sponsored study. It focuses on designing real-time command and control or battle management systems for parallel and distributed architectures. Due to delays in other ARPA programs, the targeted architectures were not available during the time frame of the study. The results of the study were, however, tested on more conventional sequential and parallel platforms. The design method discussed here is fundamentally different from those assumed by current real-time scheduling theories, e.g., rate-monotonic, earliest-deadline-first, least-laxity or best-effort. These theories assume that the fundamental unit of prioritization is the task. In this new method, the fundamental unit of prioritization is called a work item. Work items are functions the system performs that have timing requirements (deadlines) associated with them in the requirements specification. Current scheduling theories are applied using artifact deadlines introduced by designers whereas this new method schedules work items to meet specification deadlines (sometimes called end-to-end deadlines) required by the user. With this method, tasks have no priorities. A collection of tasks with no priorities will be called a collection of peer tasks. The study showed that it is possible to schedule work items based on importance rather than urgency while still meeting as many work item deadlines as can be met by scheduling tasks with respect to urgency. Also, it showed that the minimum on-line deadline that can be guaranteed for a work item of highest importance, scheduled at run-time, is approximately the inverse of the throughput, measured in work items per second, for a work load consisting only of work items of that type. Further, it was shown that it provides optimal utilization of a single processor machine, and that its timing behavior is predictable (provable) for both single and multiprocessor machines. Finally, it was shown that throughput is not degraded during overload.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"21 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":"133871503","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}

引用次数: 5

Distributed and parallel execution in Ada 83 Ada 83中的分布式并行执行

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems Pub Date : 1995-04-25 DOI: 10.1109/WPDRTS.1995.470507

R. Volz, R. Theriault, G. C. Smith, R. Waldrop

引用次数: 5

Predictability of program execution times on superscalar pipelined architectures 在超标量流水线体系结构上程序执行时间的可预测性

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems Pub Date : 1995-04-25 DOI: 10.1109/WPDRTS.1995.470500

U. Chandra, Marion, Harmon

{"title":"Predictability of program execution times on superscalar pipelined architectures","authors":"U. Chandra, Marion, Harmon","doi":"10.1109/WPDRTS.1995.470500","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470500","url":null,"abstract":"Predicting the execution time of straight line code sequences is essential for reliable real-time systems. Traditional timing techniques suck as table lookup method, instruction counting and averaging are inadequate to predict a tight execution time on reduced instruction set processors since they do not account for the low-level parallelism that exists in these processors. This paper presents a server based methodology for predicting point-to-point execution times of code segments. A sequence of assembler instructions is analyzed to identify the execution paths and the basic blocks within the execution path. The execution of these assembler instructions is simulated by scheduling them on the different servers such as caches and pipelines. Performance is predicted by consolidating the execution times of the basic blocks and then the execution paths. This methodology was applied to Alpha AXP architecture as a case study. Execution times of three benchmark programs were observed on an Alpha AXP machine and predicted using this methodology. The worst case time predicted by this methodology bounds the observed worst case time and the best case execution time is lower than the observed best case execution time.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"33 11 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":"128926489","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}

引用次数: 9

On building distributed soft real-time systems 构建分布式软实时系统

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems Pub Date : 1995-04-25 DOI: 10.1109/WPDRTS.1995.470512

Ben Kao, Hector Garcia-Molina, Brad Adelberg

引用次数: 5

Object-oriented programming with protected types in Ada 95 Ada 95中具有受保护类型的面向对象编程

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems Pub Date : 1995-04-25 DOI: 10.1109/WPDRTS.1995.470506

A. Wellings, S. Mitchell, A. Burns

引用次数: 3

Real-time networking over HIPPI HIPPI上的实时网络

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems Pub Date : 1995-04-25 DOI: 10.1109/WPDRTS.1995.470504

R. Bettati, A. Nica

引用次数: 5

On the use of Ada tasking in the building of satellite control software Ada任务处理在卫星控制软件开发中的应用

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems Pub Date : 1995-04-25 DOI: 10.1109/WPDRTS.1995.470508

T. Vardanega

引用次数: 4

The challenge of the increased use of COTS: a developer's perspective 增加使用COTS的挑战:开发人员的观点

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems Pub Date : 1995-04-25 DOI: 10.1109/WPDRTS.1995.470494

J. Caruso

引用次数: 11

SATURNE: a reactive-anytime programming model for intelligent embedded real-time systems SATURNE:智能嵌入式实时系统的随时响应编程模型

Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems Pub Date : 1995-04-25 DOI: 10.1109/WPDRTS.1995.470497

M. Adelantado, F. Boniol, S. de Givry

{"title":"SATURNE: a reactive-anytime programming model for intelligent embedded real-time systems","authors":"M. Adelantado, F. Boniol, S. de Givry","doi":"10.1109/WPDRTS.1995.470497","DOIUrl":"https://doi.org/10.1109/WPDRTS.1995.470497","url":null,"abstract":"One of the major challenge of next embedded systems is to involve intelligence while preserving the classical real-time properties: (a) reactivity, i.e. the capability to react continuously towards asynchronous inputs, and (b) predictability. Furthermore, one of the main property which is requested in this kind of systems operating in a highly non-deterministic outside environment, is adaptability to new and unexpected conditions, and particularly to dynamic temporal deadlines. Strong predictability often means that it should be possible to prove both the functional and temporal behavior of a system, in response to any combination of signals from outside environment, and particularly to prove that critical tasks meet their deadlines. On the contrary, in non-deterministic environments involving dynamic timing constraints, the assumption that critical tasks meet their deadlines can not be guaranteed. In that sense, strong predictability and adaptability are contradictory requirements. Furthermore, intelligence often means complex computations. In that sense reactivity and punctuality seem also to be incompatible with reasoning capabilities. The aim of this paper is to investigate a programming model, called SATURNE, addressing the issue of intelligent real-time systems, that is how to mix adaptability, reactivity and predictability. We only focuses on adaptability to temporal deadlines, addressing the problem of guaranteeing a response when temporal deadlines may be statically unpredictable. SATURNE is based on a mixed reactive-anytime approach. The main idea is to introduce firstly a reactive model of computation providing predictability, and secondly an anytime model of computation providing adaptability to dynamic temporal deadlines.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"26 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":"123515806","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}

引用次数: 2