Filters








254,878 Hits in 7.3 sec

Page 7323 of Mathematical Reviews Vol. , Issue 90M [page]

1990 Mathematical Reviews  
GPCs’ lower bound complexity of Q(n log n) time is established, and we give optimal solutions on the sequen- tial model in O(nlogn) time, on the CREW PRAM model in O(log n) time with n processors, on the  ...  -, and A‘-completeness results, thus tying these four classes closely together.” 90m:68048 68Q15 68Q05 Kriegel, Klaus (DDR-ADW); Waack, Stephan (DDR-ADW) Lower bounds on the complexity of real-time branching  ... 

Guest Editorial Special Section on Real-Time and (Networked) Embedded Systems—II

Thomas Nolte, Roberto Passerone
2010 IEEE Transactions on Industrial Informatics  
Real-Time and Control Real-time systems theory often builds upon a set of assumptions of the system and its corresponding model.  ...  Instead, combining control theory with real-time scheduling mechanisms introduces flexibility in both the modeled system and its implementation, allowing the system to adapt to changing behaviors and scenarios  ... 
doi:10.1109/tii.2010.2078931 fatcat:jyinh7o5gbdtbgsglt2sylkeua

Preface: Multiprocessor Scheduling, Theory and Applications [chapter]

Eugene Levner
2007 Multiprocessor Scheduling, Theory and Applications  
and solve them in polynomial time.  ...  As a result, a great diversity of scheduling models and optimization techniques have been developed that found wide applications in industry, transport and communications.  ...  The chapter presents the principal results related to complexity, approximability and non-approximability of scheduling problems in presence of communication delays.  ... 
doi:10.5772/5211 fatcat:i4hco3bepjeo3i2eps3g46miga

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

Pontus Ekberg, Wang Yi
2015 Real-time systems  
Models and Complexity Results in Real-Time Scheduling Theory. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1324. 32 pp.  ...  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.  ...  In the jargon of real-time scheduling theory, a task model refers to such a formalism.  ... 
doi:10.1007/s11241-015-9225-0 fatcat:cy6d3r3ljbb4lmi26ov2o54tcq

Verification of Real-Time Designs: Combining Scheduling Theory with Automatic Formal Verification [chapter]

Victor A. Braberman, Miguel Felder
1999 Lecture Notes in Computer Science  
Unlike previous formal approaches, we draw from that theory and build small formal models (based on Timed Automata) to be analyzed by means of model checking tools.  ...  We present an automatic approach to verify designs of realtime distributed systems for complex timing requirements.  ...  Acknowledgements We are in debt with Prof. Mauro Pezzk from Politecnico de Milano, who supervised the first part of this research.  ... 
doi:10.1007/3-540-48166-4_30 fatcat:y3lzil7lrjhljh5n2sxn2oonbu

Formal Asymptotic Analysis of Online Scheduling Algorithms for Plug-In Electric Vehicles' Charging

Asad Ahmed, Osman Hasan, Falah Awwad, Nabil Bastaki, Syed Rafay Hasan
2018 Energies  
In online settings, the low computational complexity of the corresponding scheduling algorithms is of paramount importance for the reliable, secure, and efficient operation of the grid system.  ...  A large-scale integration of plug-in electric vehicles (PEVs) into the power grid system has necessitated the design of online scheduling algorithms to accommodate the after-effects of this new type of  ...  In this paper, we propose a real theory-based formalization of all asymptotic notations using the HOL-Light theorem prover and utilize them to analyze the computational complexity of online scheduling  ... 
doi:10.3390/en12010019 fatcat:dfzezxhsujau5ns7ak2q7arvni

Verification of real-time designs

Victor A. Braberman, Miguel Felder
1999 Software engineering notes  
Unlike previous formal approaches, we draw from that theory and build small formal models (based on Timed Automata) to be analyzed by means of model checking tools.  ...  We present an automatic approach to verify designs of realtime distributed systems for complex timing requirements.  ...  Acknowledgements We are in debt with Prof. Mauro Pezzk from Politecnico de Milano, who supervised the first part of this research.  ... 
doi:10.1145/318774.319266 fatcat:ziglrjxlnzblrdlaz5ywwu5fja

FEL-H Robust Control Real-Time Scheduling

Bing Du, Chun Ruan
2009 Journal of Software Engineering and Applications  
In this paper, we pursue this goal by formulating and simulating new real-time scheduling models that enable us to easily analyse feedback scheduling with various constraints, overload and disturbance,  ...  An important challenge for future research is how to model and introduce control mechanisms to real-time systems to improve real-time performance, and to allow the system to adapt to changes in the environment  ...  PID to design a complex real-time scheduling system.  ... 
doi:10.4236/jsea.2009.21010 fatcat:mlmskphclvhtjikskgal5545hi

A control-theoretical methodology for the scheduling problem [article]

Carlo A. Furia, Alberto Leva, Martina Maggio, Paola Spoletini
2010 arXiv   pre-print
A few experiments demonstrate the feasibility of the approach on a real-time benchmark.  ...  This approach allows the re-use of control-theoretical techniques to design efficient scheduling algorithms; it frames and solves the scheduling problem in a general setting; and it can naturally tackle  ...  As it is common with feedback scheduling, it focuses on soft real-time, where the failure to respect a deadline does not result in a global failure of the system, and average performance is what matters  ... 
arXiv:1009.3455v1 fatcat:temlogrfxfci3c7vdk47fuskga

Control-Scheduling Codesign: A Perspective on Integrating Control and Computing [article]

Feng Xia, Youxian Sun
2008 arXiv   pre-print
control and real-time computing.  ...  To achieve much better system performance in unpredictable environments than traditional design approaches, a novel methodology, control-scheduling codesign, is emerging in the context of integrating feedback  ...  From 1970s, a large number of results have been reported in the literature of real-time scheduling theory [6] .  ... 
arXiv:0806.1385v1 fatcat:sowqqc5ccfgirae5z3ct575x4i

Rescheduling in Industrial Environments: Emerging Technologies and Forthcoming Trends

Carmen L. Garcia-Mata, Pedro Rafael Márquez-Rodríguez, Larysa Burtseva
2015 International Journal of Combinatorial Optimization Problems and Informatics  
The scheduling problems in Manufacturing Systems are characterized by a high degree of uncertainties arising from diverse factors such as stochastic environments and data incompleteness.  ...  In this research, selected cases from the last ten years of stochastic scheduling literature are reviewed, specially the ones relatives to Semiconductor Factories.  ...  Although the complexity of SAT is an exponential run time for all known algorithms in the worst-case, experimental results have showed that most real-world problems can be solved by SAT solvers in polynomial  ... 
dblp:journals/ijcopi/Garcia-MataMB15 fatcat:hd7c4tretfai7jgcjajrqwvaqe

A Truthful Dynamic Workflow Scheduling Mechanism for Commercial Multicloud Environments

Hamid Mohammadi Fard, Radu Prodan, Thomas Fahringer
2013 IEEE Transactions on Parallel and Distributed Systems  
In this paper, we introduce a pricing model and a truthful mechanism for scheduling single tasks considering two objectives: monetary cost and completion time.  ...  ., minimizing the completion time and monetary cost, we extend the mechanism for dynamic scheduling of scientific workflows.  ...  ACKNOWLEDGMENTS This work was funded by the Austrian Science Fund (FWF), project TRP 72-N23, and by the Standortagentur Tirol, project RainCloud.  ... 
doi:10.1109/tpds.2012.257 fatcat:5qxx2o5sgvhbzafffovrsp3xje

Eliminating the 'hard'/'soft' real-time dichotomy

E.D. Jensen
1997 Computing & control engineering journal  
Again, in larger, more complex, more distributed systems, collective timeliness is often preferably or necessarily "softer" in the sense of classical scheduling theory optimization criteria such as the  ...  The absence of an effective definition of "soft" real-time results in ad hoc resource management which limits the kinds of real-time systems that can be built and the cost-effectiveness of those that are  ... 
doi:10.1049/cce:19970104 fatcat:2wg3jheoobajnpzyoepirhd7bu

Page 2180 of Mathematical Reviews Vol. , Issue 2000c [page]

2000 Mathematical Reviews  
Thus, our real RAM model not only expresses exactly the computational power of Turing machines on real numbers (in the sense of Grzegorczyk), but also yields a high-level tool for realistic time complexity  ...  Summary: “We present a modified real RAM model which is equipped with the usual discrete and real-valued arithmetic opera- tions and with a finite precision test <, which allows comparisons of real numbers  ... 

Rate Monotonic Analysis for Real-Time Systems [chapter]

Lui Sha, Mark H. Klein, John B. Goodenough
1991 Foundations of Real-Time Computing: Scheduling and Resource Management  
The essential goal of the Rate Monotonic Analysis (RMA) for Real-Time Systems Project at the Software Engineering Institute is to catalyze improvement in the practice of real-time systems engineering,  ...  specifically by increasing the use of rate monotonic analysis and scheduling algorithms.  ...  As a result, real-time system engineering based on rate monotonic theory has been: • Recommended by both the 1st and 2nd International Workshop on Real-Time Ada Issues for real-time applications using  ... 
doi:10.1007/978-1-4615-3956-8_5 fatcat:drizskktazaxvlaeri6ummfjna
« Previous Showing results 1 — 15 out of 254,878 results