2015 IEEE 18th International Symposium on Real-Time Distributed Computing最新文献_第4页

Guarded Sections: Structuring Air for Wait-Free Synchronisation 保护部分:结构空气无等待同步

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.17

Gabor Drescher, Wolfgang Schröder-Preikschat

引用次数: 5

FPGA-based Mixed-Criticality Execution Platform for SystemJ and the Internet of Industrial Things 基于fpga的系统与工业物联网混合临界执行平台

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.27

Dez Packwood, Manu Sharma, Ding Ding, Heejong Park, Z. Salcic, Avinash Malik, K. Wang

{"title":"FPGA-based Mixed-Criticality Execution Platform for SystemJ and the Internet of Industrial Things","authors":"Dez Packwood, Manu Sharma, Ding Ding, Heejong Park, Z. Salcic, Avinash Malik, K. Wang","doi":"10.1109/ISORC.2015.27","DOIUrl":"https://doi.org/10.1109/ISORC.2015.27","url":null,"abstract":"This paper presents an extensible and adaptable platform for distributed applications with mixed criticality based on using state of the art FPGA technology. Although capable of executing programs written in different languages, the platform specifically targets the execution of programs written in Globally Asynchronous Locally Synchronous language SystemJ used in the context of Internet of Industrial Things. The key properties of the prototype platform are accommodation of mixed-criticality processing as well as provision of Internet addressable services. Mixed-criticality execution platform (MCEP) uses multiple processor cores and network interfaces: (1) a dual-core ARM processor with Ethernet for Internet access and processing of non-real -- time application parts and (2) TP-JOP reactive hard real-time processor with customized Controller Area Network (CAN) for real-time and time-critical response processing. This platform has been successfully developed and used in an industrial automation system within the Internet of Industrial Things context.","PeriodicalId":294446,"journal":{"name":"2015 IEEE 18th International Symposium on Real-Time Distributed Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125976458","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

Exploring Situation Theory Using InfonLab 利用InfonLab探索情境理论

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.20

Eugene Doma, B. Selić, D. Levy

引用次数: 1

Flexible Framework for Statistical Schedulability Analysis of Probabilistic Sporadic Tasks 概率偶发任务统计可调度性分析的灵活框架

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.21

Abdeldjalil Boudjadar, J. H. Kim, Alexandre David, K. Larsen, Marius Mikucionis, Ulrik Nyman, A. Skou, Insup Lee, L. T. Phan

引用次数: 2

Multichannel Admission Control for Military Training Network 军事训练网络的多通道准入控制

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.28

Hawar Ramazanali, M. Jonsson, A. Vinel, U. Bilstrup

引用次数: 3

Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors 基于动态分区的多核处理器实时任务调度

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.23

N. Saranya, R. Hansdah

{"title":"Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors","authors":"N. Saranya, R. Hansdah","doi":"10.1109/ISORC.2015.23","DOIUrl":"https://doi.org/10.1109/ISORC.2015.23","url":null,"abstract":"Existing real-time multicore schedulers use either global or partitioned scheduling technique to schedule real-time tasks. Partitioned scheduling is a static approach in which, a task is mapped to a per-processor ready queue prior to scheduling it and it cannot migrate. Partitioned scheduling makes ineffective use of the available processing power and incurs high overhead when real-time tasks are dynamic in nature. Global scheduling is a dynamic scheduling approach, where the processors share a single ready-queue to execute the highest priority tasks. Global scheduling allows task migration which results in high scheduling overhead. In this paper, we present a dynamic partitioning based scheduling of real-time tasks, called DP scheduling. In DP scheduling, jobs of tasks are assigned to cores when they are released and remain in the same core till they finish execution. The partitioning in DP scheduling is done based on the slack time and priority of jobs. If a job cannot be allocated to any core, then it is split, and executed on more than one core. DP scheduling technique attempts to retain good features of both global and partitioned scheduling without compromising on resource utilization, and at the same time, also tries to minimize the scheduling overhead. We have tested DP scheduling technique with EDF scheduling policy at each core, and we term this scheduling algorithm as DP-EDF. The performance of DP-EDF scheduling algorithm has been evaluated using simulation study and its implementation in LITMUS-RT on a 64-bit intel processor with eight logical cores. Both simulation and experimental results show that DP-EDF scheduling algorithm has better performance in terms of resource utilization, and comparable or better performance in terms of scheduling overhead in comparison to contemporary scheduling algorithms.","PeriodicalId":294446,"journal":{"name":"2015 IEEE 18th International Symposium on Real-Time Distributed Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128815669","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

Fairness-Based Measures for Safety-Critical Vehicular Ad-Hoc Networks 基于公平性的安全关键车辆Ad-Hoc网络措施

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.44

M. Hikmet, P. Roop, P. Ranjitkar

{"title":"Fairness-Based Measures for Safety-Critical Vehicular Ad-Hoc Networks","authors":"M. Hikmet, P. Roop, P. Ranjitkar","doi":"10.1109/ISORC.2015.44","DOIUrl":"https://doi.org/10.1109/ISORC.2015.44","url":null,"abstract":"Transmission timing and delay between communicating vehicles are two important performance measures for safety-critical applications of Vehicular Ad-Hoc Networks (VANETS). Safety-Critical VANETS are composed of multiple nodes each requiring access to a shared communication medium. This access is controlled by the Medium Access Control (MAC) protocol. Numerous MAC protocols have been proposed for VANETS, each with varying degrees of reliability and fairness. A general measure for fairness is required in order to compare different protocols using the same criteria, however, finding a quantifiable measure for fairness is not a simple task and any developed quantifiable measure is application-specific. In this paper, we investigate different measures of fairness, particularly the Jain Index and the Gini Coefficient. We apply these measures to experimental environments in ns-3 to contrast the different fairnesses of three MAC protocols: CSMA/CA, TDMA, and STDMA. It became evident, after experimentation, that the Gini Coefficients obtained from these experiments would vary between iterations and the limits of these variances were uncertain. Therefore we derive a formula which allows a theoretical limit to be placed on the unfairness of a system based on its upper and lower bounds of delay. This formula is not only relevant to VANETs but to any network. The work in this paper is applicable to any discipline wishing to measure the theoretical worst case fairness of a population.","PeriodicalId":294446,"journal":{"name":"2015 IEEE 18th International Symposium on Real-Time Distributed Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120843087","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}

引用次数: 4

Real-Time Communication for the Internet of Things Using jCoAP 基于jCoAP的物联网实时通信

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.35

Björn Konieczek, Michael Rethfeldt, F. Golatowski, D. Timmermann

{"title":"Real-Time Communication for the Internet of Things Using jCoAP","authors":"Björn Konieczek, Michael Rethfeldt, F. Golatowski, D. Timmermann","doi":"10.1109/ISORC.2015.35","DOIUrl":"https://doi.org/10.1109/ISORC.2015.35","url":null,"abstract":"The term Internet of Things (IoT) describes a scenario where embedded systems are integrated into everyday objects, turning them into smart devices to assist the user in his everyday life. Each of these smart objects only offers a very limited amount of computational power since it is only specialized in a limited set of tasks. In order to achieve complex goals, the devices have to interact with each other. Therefore, they do not only need to be interconnected either by wire or through wireless technology but also need a set of common protocols to enable vendor-independent communication. In the past years, various protocols pursuing this objective have emerged. One of the most promising approaches is the Constrained Application Protocol (CoAP) because it offers high interoperability and very low communication overhead at the same time. Typical IoT applications include the observation and manipulation of their environment through sensors and actuators. Since the physical world is continuous in time and does not wait for calculations to finish, it is essential that the execution times of the applications stay within certain boundaries. These timing constraints are referred to as real-time requirements. However, current protocol implementations do not consider real-time requirements for IoT applications. In this paper, we introduce the jCoAP communication stack as a lightweight Java implementation of CoAP. We give a brief introduction to real-time communication and CoAP and provide insight in the design concept of jCoAP and the offered functionalities. Furthermore, a performance evaluation is done in order to point out the suitability of the jCoAP framework for real-time IoT applications.","PeriodicalId":294446,"journal":{"name":"2015 IEEE 18th International Symposium on Real-Time Distributed Computing","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125390676","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}

引用次数: 22

Message Passing on a Time-predictable Multicore Processor 时间可预测多核处理器上的消息传递

2015 IEEE 18th International Symposium on Real-Time Distributed Computing Pub Date : 2015-04-13 DOI: 10.1109/ISORC.2015.15

R. B. Sorensen, Wolfgang Puffitsch, Martin Schoeberl, J. Sparsø

引用次数: 13