2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)最新文献_第2页

Distributed Utilization Control for Real-Time Clusters with Load Balancing 基于负载均衡的实时集群分布式利用率控制

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.20

Yong Fu, Hongan Wang, Chenyang Lu, R. S. Chandra

引用次数: 39

Optimal Dimensioning of a Constant Bandwidth Server 恒带宽服务器的最优尺寸

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.31

G. Buttazzo, Enrico Bini

引用次数: 25

Run-Time Services for Hybrid CPU/FPGA Systems on Chip 芯片上混合CPU/FPGA系统的运行时服务

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.45

J. Agron, W. Peck, E. Anderson, D. Andrews, E. Komp, R. Sass, Fabrice Baijot, Jim Stevens

{"title":"Run-Time Services for Hybrid CPU/FPGA Systems on Chip","authors":"J. Agron, W. Peck, E. Anderson, D. Andrews, E. Komp, R. Sass, Fabrice Baijot, Jim Stevens","doi":"10.1109/RTSS.2006.45","DOIUrl":"https://doi.org/10.1109/RTSS.2006.45","url":null,"abstract":"Modern FPGA devices, which include (multiple) processor core(s) as diffused IP on the silicon die, provide an excellent platform for developing custom multiprocessor systems-on-programmable chip (MPSoPC) architectures. As researchers are investigating new methods for migrating portions of applications into custom hardware circuits, it is also critical to develop new run-time service frameworks to support these capabilities. Hthreads (HybridThreads) is a multithreaded RTOS kernel for hybrid FPGA/CPU systems designed to meet this new growing need. A key capability of hthreads is the migration of thread management, synchronization primitives, and run-time scheduling services for both hardware and software threads into hardware. This paper describes the hthreads scheduler, a key component for controlling both software-resident threads (SW threads) and threads implemented in programmable logic (HW threads). Run-time analysis shows that the hthreads scheduler module helps in reducing unwanted system overhead and jitter when compared to historical software schedulers, while fielding scheduling requests from both hardware and software threads in parallel with application execution. Run time analysis shows the scheduler achieves constant time scheduling for up to 256 active threads with a total of 128 different priority levels, while using uniform APIs for threads requesting OS services from either side of the hardware/software boundary","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126370941","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}

引用次数: 49

Design of Location Service for a Hybrid Network of Mobile Actors and Static Sensors 移动参与者和静态传感器混合网络的位置服务设计

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.17

Zhigang Chen, M. Cho, K. Shin

{"title":"Design of Location Service for a Hybrid Network of Mobile Actors and Static Sensors","authors":"Zhigang Chen, M. Cho, K. Shin","doi":"10.1109/RTSS.2006.17","DOIUrl":"https://doi.org/10.1109/RTSS.2006.17","url":null,"abstract":"Location services are essential to many applications running on a hybrid of wirelessly-networked mobile actors and static sensors, such as surveillance systems and the pursuer and evader game (PEG). To our best knowledge, there has been no previous location service protocol for wireless sensor networks. A number of location service protocols have been proposed for mobile ad hoc networks, but they are not applicable to sensor networks due to the usually large per-hop latency between sensors. This paper presents a distributed location service protocol (DLSP) for wireless sensor networks. Using a rigorous analysis of DLSP, we derive the condition for achieving a high packet-delivery ratio, and show how to configure the protocol parameters to ensure the scalability of DLSP. We find that DLSP is scalable if the mobile's speed is below a certain fraction of the packet-transmission speed, which depends on a movement threshold. For example, if the movement threshold for the location servers at the lowest level equals the radio range, the speed limit is one-tenth of the packet-transmission speed. The mobile's theoretical speed limit is one-fifth of the packet-transmission speed, beyond which DLSP cannot scale regardless of the movement threshold. Because of the high location-update overhead of DLSP, we propose an optimization, DLSP-SN, which can reduce the overhead by over 70%, while achieving high packet-delivery ratios. However, due to the griding effect, the packet's path length of DLSP-SN may be longer than that of DLSP, incurring higher data-delivery cost","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121887969","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

Tightening the Bounds on Feasible Preemption Points 收紧可行抢占点的界限

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.49

H. Ramaprasad, F. Mueller

{"title":"Tightening the Bounds on Feasible Preemption Points","authors":"H. Ramaprasad, F. Mueller","doi":"10.1109/RTSS.2006.49","DOIUrl":"https://doi.org/10.1109/RTSS.2006.49","url":null,"abstract":"Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timing predictability of single real-time tasks has been the focus of much research, bounding the overhead of cache warm-ups after preemptions remains a challenging problem, particularly for data caches. This paper makes multiple contributions. 1) We bound the penalty of cache interference for real-time tasks by providing accurate predictions of data cache behavior across preemptions, including instruction cache and pipeline effects. We show that, when considering cache preemption, the critical instant does not occur upon simultaneous release of all tasks. 2) We develop analysis methods to calculate upper bounds on the number of possible preemption points for each job of a task. To make these bounds tight, we consider the entire range between the best-case and worst-case execution times (BCET and WCET) of higher priority jobs. The effects of cache interference are integrated into the WCET calculations by using a feedback mechanism to interact with a static timing analyzer. Significant improvements in tightening bounds of up to an order of magnitude over two prior methods and up to half a magnitude over a third prior method are obtained by experiments for (a) the number of preemptions, (b) the WCET and (c) the response time of a task. Overall, this work contributes by calculating the worst-case preemption delay under consideration of data caches","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117147107","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}

引用次数: 54

Resource Sharing in EDF-Scheduled Systems: A Closer Look edf调度系统中的资源共享:深入研究

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.41

Sanjoy Baruah

引用次数: 83

Sustainable Scheduling Analysis 可持续调度分析

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.47

Sanjoy Baruah, A. Burns

引用次数: 189

Prediction of Timing Constraint Violation for Real-Time Embedded Systems with Known Transient Hardware Failure Distribution Model 已知暂态硬件故障分布模型的实时嵌入式系统时间约束违反预测

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.33

Yue Yu, Shangping Ren, O. Frieder

引用次数: 14

LITMUS^RT : A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers LITMUS^RT:一个经验比较实时多处理器调度程序的测试平台

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.27

J. Calandrino, Hennadiy Leontyev, Aaron D. Block, Umamaheswari Devi, James H. Anderson

引用次数: 326

Combined Scheduling of Sensing and Communication for Real-Time Indoor Tracking in Assisted Living 基于传感与通信的室内辅助生活实时跟踪组合调度

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) Pub Date : 2006-12-05 DOI: 10.1109/RTSS.2006.13

Min-Young Nam, Mhd. Zaher Al-Sabbagh, Chang-Gun Lee

引用次数: 5