Filters








146,947 Hits in 6.5 sec

Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times

Přemysl Šůcha, Zdeněk Hanzálek
2008 Mathematical and computer modelling  
Motivated by FPGA (Field-Programmable Gate Array) architecture we formulate a problem of cyclic scheduling on one dedicated processor where tasks are constrained by the precedence delays.  ...  The problem under consideration is to find an optimal periodic schedule satisfying the timing constraints.  ...  The periodic schedule is a schedule of one iteration that is repeated with a fixed time interval called a period (also called initiation interval).  ... 
doi:10.1016/j.mcm.2007.05.009 fatcat:xa3zf253irfe3bgg7l3eheuu6u

Implications of classical scheduling results for real-time systems

J.A. Stankovic, M. Spuri, M. Di Natale, G.C. Buttazzo
1995 Computer  
Every real-time systems designer should be familiar with a set of important classical scheduling theory results, i.e., those results largely taken from the literature in complexity theory and operations  ...  The literature in scheduling theory is so vast, that we m a k e no pretense at being comprehensive. In this paper, a minimum set of results, together with their implications, is presented.  ...  Preemption reduces the complexity of the scheduling problem of precedence related tasks with di erent arrival times.  ... 
doi:10.1109/2.386982 fatcat:pgdsgkk5mbhzra4bud4w5fxerq

Making software timing properties easier to inspect and verify

Jia Xu
2003 IEEE Software  
I presented a preliminary version of this article at the First Workshop on Inspection in Software Engineering (WISE 01).  ...  Acknowledgments A Natural Sciences and Engineering Council of Canada grant partially supported this work.  ...  (A 1 ) (F) EXCLUDES (C) A 0 PRECEDES C A 0 PRECEDES A 1 A 1 PRECEDES A 2 Given the EXCLUDES relation defined on overlapping critical sections and the PRE-CEDES relation defined on the process segments  ... 
doi:10.1109/ms.2003.1207452 fatcat:fyaxnv372je2jiglmznlzkfaga

A Sampling Based Approach for Proactive Project Scheduling with Time-Dependent Duration Uncertainty

Wen Song, Donghun Kang, Jie Zhang, Hui Xi
2017 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We deal with the more challenging problem where the duration uncertainty is related to the scheduled time period.  ...  Most of the existing proactive scheduling approaches assume the durations of activities can be described by independent random variables that have no relation with time.  ...  This work was supported by the National Research Foundation (NRF) Singapore.  ... 
doi:10.1609/aaai.v31i1.11100 fatcat:wxzvqqv4hfhczinbrunzpmulei

Cyclic Data Flows in Computers and Embedded Systems [chapter]

Claire Hanen, Alix Munier-Kordon
2019 Studies in Systems, Decision and Control  
core with λ = 6 Fig. 1.8: An optimal periodic schedule 1.3.2 Periodic data transfers for a real-time system Let us consider a set of jobs based on the model of Liu and Layland [30] .  ...  Each job J i is characterized by a period T i , a processing time C i , a deadline D i , and a release date r i .  ...  • Performance of a periodic schedule: what is the optimal cycle time of a schedule with a specific periodic structure?  ... 
doi:10.1007/978-3-030-27652-2_1 fatcat:g35rnt5efjgejmuo676anabqme

A decision support system to schedule design activities with interdependency and resource constraints

Iban Lizarralde, Patrick Esquirol, Arnaud Riviere
2011 Projectics / Proyéctica / Projectique  
DEcISION SUPPORT SYSTEM TO ScHEDUlE DESIGN AcTIvITIES WITH INTERDEPENDENcY ABsTRACT This paper investigates the problems of project scheduling at the design stage of the development of a civil aircraft  ...  The development of such a complex system is characterised by a dynamic environment and uncertainties concerning the duration of activities.  ...  A project scheduling problem is one of the problems that is usually explained in this literature: it can be defined as a "problem concerned with the scheduling of a number of jobs that are subject to precedence  ... 
doi:10.3917/proj.007.0089 fatcat:ipof2ikizrb57c2hl2r3of42mm

Page 6615 of Mathematical Reviews Vol. , Issue 2004h [page]

2004 Mathematical Reviews  
Summary: “We study the problem of scheduling a single machine with the precedence relation on the set of jobs to minimize average weighted completion time. The problem is strongly NP-hard.  ...  (n,m) denotes the complexity of the maximal flow computation in a network with n nodes and m arcs.  ... 

On inspection and verification of software with timing requirements

Jia Xu
2003 IEEE Transactions on Software Engineering  
Preruntime scheduling provides such an approach by placing restrictions on software structures to reduce complexity.  ...  A major benefit of using a preruntime scheduling approach is that it makes it easier to systematically inspect and verify the timing properties of the actual software code, not just various high-level  ...  A preliminary version of this paper was presented at the First Workshop on Inspection in Software Engineering (WISE'01), Paris, France, July 21, 2001.  ... 
doi:10.1109/tse.2003.1223645 fatcat:6xnwrtumb5bonexja7rk6ydc5u

A note on periodic schedules for linear precedence constraints

Vladimir Kats, Eugene Levner
2013 Discrete Applied Mathematics  
Munier Kordon, Periodic schedules for linear precedence constraints, Discrete Applied Mathematics 157 (2) (2009) 280-291] have considered a problem of scheduling periodic tasks each of which has to be  ...  First, we suggest a further generalization of the unitary relations that extends the usual not-later precedence relations; as a result, the arc lengths and heights in the underlying graph may be negative  ...  Acknowledgments The authors thank Profs. Endre Boros and Uri Rothbloom, and anonymous reviewers for their valuable comments and suggestions.  ... 
doi:10.1016/j.dam.2012.09.002 fatcat:5hnsugob4ve6fl7duz2f73yspi

Scheduling Dependent Periodic Tasks without Synchronization Mechanisms

Julien Forget, Frédéric Boniol, Emmanuel Grolleau, David Lesens, Claire Pagetti
2010 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium  
This article studies the scheduling of critical embedded systems, which consist of a set of communicating periodic tasks with constrained deadlines.  ...  We propose fixed priority scheduling policies for different classes of dependent tasks: with simultaneous or arbitrary release times, with simple precedences (between tasks of the same period) or extended  ...  EXTENDED PRECEDENCES We now consider the problem of scheduling a set of periodic tasks with arbitrary release times, constrained deadlines and periodic extended precedences. A.  ... 
doi:10.1109/rtas.2010.26 dblp:conf/rtas/ForgetBGLP10 fatcat:ideq5zxmcvepdfnmmtgwuemswi

A survey of pipelined workflow scheduling

Anne Benoit, Ümit V. Çatalyürek, Yves Robert, Erik Saule
2013 ACM Computing Surveys  
A large class of applications need to execute the same workflow on different data sets of identical size.  ...  The scheduling problem that encompasses all of these techniques is called pipelined workflow scheduling, and it has been widely studied in the last decade.  ...  Anne Benoit and Yves Robert are with the Institut Universitaire de France.  ... 
doi:10.1145/2501654.2501664 fatcat:avzu434g2zbptm532lii42bqx4

Page 3477 of Mathematical Reviews Vol. , Issue 91F [page]

1991 Mathematical Reviews  
The author shows that the polynomially solvable bump-number problem is equivalent to a 2-machine flow-shop problem with precedence relation con- straints.  ...  The monotone trajectory principle for a model of a complex renewable system with one repair unit. (Russian) Vestnik Moskov. Univ. Ser. I Mat. Mekh. 1990, no. 2, 7-13, 104.  ... 

Time-Triggered Co-Scheduling of Computation and Communication with Jitter Requirements

Anna Minaeva, Benny Akesson, Zdenek Hanzalek, Dakshina Dasari
2018 IEEE transactions on computers  
applications. 2) A heuristic approach, employing three levels of scheduling scaling to real-world use-cases with 10000 tasks and messages. 3) An experimental evaluation of the proposed approaches on a  ...  In particular, automotive embedded systems are highly complex in nature, and their functionality is realized by a set of periodic tasks.  ...  , within project UID/CEC/04234/2013 (CISTER Research Centre); also by FCT/MEC and the EU ARTEMIS JU within project(s) ARTEMIS/0001/2013 -JU grant nr. 621429 (EMC2).  ... 
doi:10.1109/tc.2017.2722443 fatcat:3sm4xpmpqbgk7ntm7eqh4z2neq

Project Scheduling Approach to Production Planning

A. Márkus, J. Váncza, T. Kis, A. Kovács
2003 CIRP annals  
Although the capacity and material flow aspects of PP are coupled, a special solver developed for the project model efficiently solves problems of real-life sizes.  ...  The model is applicable at different aggregation levels of PP, as we show with two real-life case studies.  ...  For a simple example, see Fig. 1 with data of two projects. Activity 1 and 2 are linked by a precedence relation. The resources have a unit capacity.  ... 
doi:10.1016/s0007-8506(07)60601-5 fatcat:bwqfnropznemdd2xxczm3flti4

Selection and scheduling of jobs with time-dependent duration

DM Seegmuller, SE Visagie, HC De Kock, WJ Pienaar
2007 ORiON  
In this paper two mathematical programming models, both with multiple objective functions, are proposed to solve four related categories of job scheduling problems.  ...  All four of these categories have the property that the duration of the jobs is dependent on the time of implementation and in some cases the preceding job.  ...  Thus in triplet notation our problem is related to a 1|prmp, s j,k , prec| w j , C max scheduling problem.  ... 
doi:10.5784/23-1-44 fatcat:i6es4etjkrg47opxhzfwufif6a
« Previous Showing results 1 — 15 out of 146,947 results