Filters








133 Hits in 5.3 sec

An optimal resource sharing protocol for generalized multiframe tasks

Pontus Ekberg, Nan Guan, Martin Stigge, Wang Yi
2015 Journal of Logical and Algebraic Methods in Programming  
We propose a new scheduling algorithm and show that it is optimal for scheduling generalized multiframe tasks with shared resources on uniprocessor systems.  ...  However, techniques for optimal scheduling and exact feasibility analysis of systems with mutuallyexclusive shared resources have been available only for relatively simple task models, such as the sporadic  ...  We would like to thank the anonymous reviewers for their helpful and insightful comments.  ... 
doi:10.1016/j.jlamp.2014.10.001 fatcat:g2ogn454cnbnbgfqchzhp45gmu

Scheduling analysis of tasks constrained by TDMA: Application to software radio protocols

Shuai Li, Frank Singhoff, Stéphane Rubini, Michel Bourdellès
2017 Journal of systems architecture  
The tasks also have dependencies through precedence and shared resources.  ...  We propose a task model called Dependent General Multiframe (DGMF) to capture the specificities of such a system for scheduling analysis.  ...  In [27] the authors propose an optimal shared resource access protocol for GMF tasks but the protocol is not implemented in the OS of Thales products.  ... 
doi:10.1016/j.sysarc.2016.11.003 fatcat:r7dhg5jj2vd5va5aml2frtw6li

Scheduling Analysis of TDMA-Constrained Tasks: Illustration with Software Radio Protocols

Shuai Li, Stephane Rubini, Frank Singhoff, Michel Bourdelles
2014 2014 IEEE Intl Conf on High Performance Computing and Communications, 2014 IEEE 6th Intl Symp on Cyberspace Safety and Security, 2014 IEEE 11th Intl Conf on Embedded Software and Syst (HPCC,CSS,ICESS)  
To encompass this issue, this paper proposes a new task model called Dependent General Multiframe (DGMF).  ...  This model extends the existing GMF model with precedence dependency and shared resource synchronization.  ...  In [7] the authors propose an optimal resource sharing protocol for GMF tasks. In our work, we also focus on precedence dependencies that is not handled by [7] .  ... 
doi:10.1109/hpcc.2014.90 dblp:conf/hpcc/LiRSB14 fatcat:gw3r6oi7hfeb5oyfe5aqasdf44

A Denial of Service Attack to GSM Networks via Attach Procedure [chapter]

Nicola Gobbo, Alessio Merlo, Mauro Migliardi
2013 Lecture Notes in Computer Science  
Nevertheless, in this paper we describe an attack to the security of a mobile network allowing an unauthenticated malicious mobile device to inject traffic in the mobile operator's infrastructure.  ...  A multiframe can carry just one message for each SDCCH in each direction, but, when the BTS requires information to the mobile phone, the latter one can answer in the same multiframe: in fact the GSM protocol  ...  This dependency does not exist only for leisurable activities, but has a definite onset also in business and critical tasks.  ... 
doi:10.1007/978-3-642-40588-4_25 fatcat:vpesw3bztfd7jognhltmcb245a

Graph-based models for real-time workload: a survey

Martin Stigge, Wang Yi
2015 Real-time systems  
This paper provides a survey on task models to characterize real-time workloads at different levels of abstraction for the design and analysis of real-time systems.  ...  ., their extensions to describe recurring and branching structures as well as general graph-and automata-based models to allow modeling of complex structures such as mode switches, local loops and also  ...  Acknowledgements The authors would like to thank the anonymous reviewers of the Real-Time Systems journal for their constructive comments on an earlier manuscript of this article.  ... 
doi:10.1007/s11241-015-9234-z fatcat:pbdxvfotabgj3h5dxrnaixyapq

Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms [article]

François Dorin, Patrick Meumeu Yomsi, Joël Goossens, Pascal Richard
2010 arXiv   pre-print
In particular, allowing migration to occur only for few tasks which cannot be assigned to any individual processor, while most tasks are assigned to specific processors, considerably reduces the runtime  ...  In this paper, we address the preemptive scheduling problem of hard real-time systems composed of sporadic constrained-deadline tasks upon identical multiprocessor platforms.  ...  The authors would like to thank Ahmed Rahni from LISI/ENSMA for his insightful comments 13 on the schedulability tests of multiframe tasks.  ... 
arXiv:1006.2637v1 fatcat:hhklux5ksfbalegceayzke4kwy

Schedulability analysis of a graph-based task model for mixed-criticality systems

Pontus Ekberg, Wang Yi
2015 Real-time systems  
These models typically consist of a collection of computational tasks, each of which generates an infinite sequence of task activations.  ...  We present an optimal scheduling algorithm and an exact schedulability test. Third, we address a pair of longstanding open problems in real-time scheduling theory.  ...  the Analysis . . . . . . . . . . . . . . . 120 III An Optimal Resource Sharing Protocol for Generalized Multiframe Tasks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .  ... 
doi:10.1007/s11241-015-9225-0 fatcat:cy6d3r3ljbb4lmi26ov2o54tcq

An anomaly prevention approach for real-time task scheduling

Ya-Shu Chen, Li-Pin Chang, Tei-Wei Kuo, Aloysius K. Mok
2009 Journal of Systems and Software  
With mutual-exclusive resource accessing, we show that new violations of the timing constraints of tasks might occur even when a more powerful processor or device is adopted.  ...  Finally, we explore policies for bounding the duration of scheduling anomalies.  ...  Fig. 7 . 7 Anomaly ratios for schedulers when only passive resources were shared among tasks. Fig. 8 . 8 Completion-time ratios for schedulers when only passive resources were shared among tasks.  ... 
doi:10.1016/j.jss.2008.07.038 fatcat:sgte62r7yzgnxc64we4bpjcshy

Resource-Sharing Servers for Open Environments

M. Bertogna, N. Fisher, S. Baruah
2009 IEEE Transactions on Industrial Informatics  
We study the problem of executing a collection of independently designed and validated task systems upon a common platform composed of a preemptive processor and additional shared resources.  ...  We present and prove the correctness of algorithms that address these issues, and thereby obtain a design for an open real-time environment.  ...  ACKNOWLEDGMENT We are extremely grateful to the anonymous reviewers of both the conference and journal versions of this paper for their help in improving the quality of the paper.  ... 
doi:10.1109/tii.2009.2026051 fatcat:pkf3kyd7yncdhhxt5ggdvxj4wi

Cognitive Self-Scheduled Mechanism for Access Control in Noisy Vehicular Ad Hoc Networks

Mario Manzano, Felipe Espinosa, Ángel M. Bravo-Santos, Alfredo Gardel-Vicente
2015 Mathematical Problems in Engineering  
approach for the design of dynamic spectrum access (DSA) mechanisms.  ...  However, cognitive radio (CR) combines the capacity to sense the radio spectrum with the flexibility to adapt to transmission parameters in order to maximize system performance and has thus become an effective  ...  Trajectory control and tracking tasks require cooperation among users.  ... 
doi:10.1155/2015/354292 fatcat:yx7wn4oiobbwnkhciu7cpv6xca

Virtual concatenation tutorial: enhancing SONET/SDH networks for data transport

Larry Choy
2001 Journal of Optical Networking  
scheme (LCAS) that address these issues, and finally present several potential applications for these technologies.  ...  Synchronous optical network (SONET) and synchronous digital hierarchy (SDH) contiguous concatenation have enabled high-speed networking in both metro and core networks for many narrow-band and broadband  ...  This in turn could ease planning and traffic reengineering in the network yet still allows optimal use of physically available bandwidth resources. • In applications requiring stringent QOS and guaranteed  ... 
doi:10.1364/jon.1.000018 fatcat:cvxg4kqbfrdplorp2eaavqlrxa

SPARE MAC Enhanced: A Dynamic TDMA Protocol for Wireless Sensor Networks

Fabio Turati, Matteo Cesana, Luca Campelli
2009 GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference  
In this work, we leverage the SPARE MAC protocol for WSN based on a receiver-oriented TDMA protocol, and we propose adaptive techniques to dynamically adjust the resource (slots) assignment which are able  ...  This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE "GLOBECOM" 2009 proceedings.  ...  The recently proposed SPARE MAC (Slot Periodic Assignment for REception) protocol [11] , instead of assigning slots for transmissions, distributes resources for the reception of data.  ... 
doi:10.1109/glocom.2009.5425974 dblp:conf/globecom/TuratiCC09 fatcat:i3kmniqwkbfmjgjqd2m7yj5lje

Discussion on Application of Embedded Operating System in Dual-Core Smart Electric Meter

Xuesong Zhao, Bensong Zhang, Shihong Yin, Qianxian Xie, Leping Zhang, Haowen Wu, Le Sun
2022 Scientific Programming  
This paper has a good reference for the application software development based on the new generation of smart meter software platform and is conducive to promoting the large-scale application of the new  ...  generation of smart meters.  ...  It is the smallest unit for operating system to allocate resources.  ... 
doi:10.1155/2022/1880811 fatcat:ldgrcpkh2jgm3n66jp6sjo2lwa

A General Framework for Parameterized Schedulability Bound Analysis of Real-Time Systems

Jianjia Wu, Jyh-Charn Liu, Wei Zhao
2010 IEEE transactions on computers  
The test is extremely simple, since it only needs to compare the utilization of the tasks with a predetermined bound. As such, utilization-based schedulability tests are suitable for online use.  ...  ., tasks and schedulers) based on network calculus techniques.  ...  In addition, the authors are grateful to Larisa Archer for helping them to edit the entire manuscript.  ... 
doi:10.1109/tc.2010.31 fatcat:jtjhvjuepzfxlattelckuwt2zq

Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers

Jianjia Wu, Jyh-Charn Liu, Wei Zhao
2007 28th IEEE International Real-Time Systems Symposium (RTSS 2007)  
Deriving the utilization bound for a given real-time system has, nevertheless, been a challenging task as it usually requires comprehensive modeling and understanding of the system and payload tasks.  ...  We obtain the optimal parameter selection that maximizes the utilization bound, then compare the new bound with those of fixed priority schedulers, and timed token ring schedulers.  ...  An alternative test is based on the schedulability bound. To perform this test, we need to generalize the classical definition of utilization for general tasks.  ... 
doi:10.1109/rtss.2007.26 dblp:conf/rtss/WuLZ07 fatcat:eqvkx6353bfppk6yrblckfebaq
« Previous Showing results 1 — 15 out of 133 results