Filters








13,007 Hits in 6.5 sec

On-Line Scheduling for Checkpointing Imprecise Computation

R. Bettati
1993 Fifth Euromicro Workshop on Real-Time Systems  
We take advantage of new results in on-line scheduling of imprecise computation to design an algorithm that dynamically adapts to failure occurrences.  ...  The imprecise-computation technique allows one to trade off computation accuracy with computation time and offers therefore the necessary scheduling flexibility required during the recovery process after  ...  This work was partially supported by US Navy Office of Naval Research Contract No. NVY N00014 89-J-1181.  ... 
doi:10.1109/emwrt.1993.639103 dblp:conf/ecrts/Bettati93 fatcat:zclkp5ztindnlfah66tg6nerhq

Page 2566 of Mathematical Reviews Vol. , Issue 97D [page]

1997 Mathematical Reviews  
974:68022 68M20 Shih, Wei-Kuan (RC-NTHU-CS; Hsinchu); Liu, Jane W.S. (1-IL-C; Urbana, IL) On-line scheduling of imprecise computations to minimize error.  ...  Comput. 25 (1996), no. 5, 1105-1121. Summary: “This paper describes three algorithms for scheduling preemptive, imprecise tasks on a processor to minimize the total error.  ... 

Algorithms for scheduling imprecise computations

J.W.S. Liu, K.-J. Lin, W.-K. Shih, A.C.-s. Yu, J.-Y. Chung, W. Zhao
1991 Computer  
n a hard real-time cyctem, every time-T critical task must meet its timing con- The system scheduler and cxccute3 to conipletion all mandatory td\k\ before their imprecise computations can be easily implemented  ...  is Flex,' an object-oriented language that supports all C++ constructs along with timing-constraint and imprecision primitives. 58 0018-9162/91/0500-0058$01.00 Q 1991 IEEE COMPUTER  ...  This work was partially supported by US Navy Office of Naval Research contracts NVY NO0014 87-K-0827 and NVY NO0014 89-J-I 181.  ... 
doi:10.1109/2.76287 fatcat:dluqluerpbbxhi2b7l54qawnkm

Algorithms for Scheduling Imprecise Computations [chapter]

J. W. S. Liu, K. J. Lin, W. K. Shih, A. C. Yu, J. Y. Chung, W. Zhao
1991 Foundations of Real-Time Computing: Scheduling and Resource Management  
n a hard real-time cyctem, every time-T critical task must meet its timing con- The system scheduler and cxccute3 to conipletion all mandatory td\k\ before their imprecise computations can be easily implemented  ...  is Flex,' an object-oriented language that supports all C++ constructs along with timing-constraint and imprecision primitives. 58 0018-9162/91/0500-0058$01.00 Q 1991 IEEE COMPUTER  ...  This work was partially supported by US Navy Office of Naval Research contracts NVY NO0014 87-K-0827 and NVY NO0014 89-J-I 181.  ... 
doi:10.1007/978-1-4615-3956-8_8 fatcat:pgqueb5wgvhyjpf6rgrc7tu6di

Page 2937 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews  
Comput. Sci. 130 (1994), no. 1, 49-72. Summary: “We study the problem of on-line job-scheduling on parallel machines with different network topologies.  ...  An on-line scheduling algorithm schedules a collection of parallel jobs with known resource requirements but unknown running times on a parallel machine.  ... 

Competitive on-line scheduling of imprecise computations

S.K. Baruah, M.E. Hickey
1996 Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences  
The on-line scheduling of systems of imprecisecomputation tasks is investigated. The system objective is to maximize the value obtained. A formal model is defined.  ...  It ia proven, however, that an on-line algorithm may in general perform arbitratily poorly as compared to a clairvoyant scheduler.  ...  It is known that online scheduling to minimize total error is, in general, impossible: "there can be no on-line algorithm that is optimal in the following sense: for any system of on-line imprecise tasks  ... 
doi:10.1109/hicss.1996.495495 dblp:conf/hicss/BaruahH96 fatcat:5eknlastsjbufiol6564atdhcq

Adaptive Fixed Priority End-To-End Imprecise Scheduling In Distributed Real Time Systems [article]

W. El-Haweet, Islam Elgedawy, Ibrahim Abd El-Salam
2013 arXiv   pre-print
We devised a new priority assignment scheme called global mandatory relevance scheme to meet the concept of imprecise computation.  ...  Also we extended the schedulability analysis algorithms presented in the old framework to allow adaptive priority assignment and to meet imprecise computation concept.  ...  One has an opportunity to make the system schedulable by using the imprecise computation technique. When a processor fails, one tries to reduce the execution time of its subtasks.  ... 
arXiv:1306.0448v1 fatcat:jwh7sfhao5bohpeumqnnrf3l5m

Genetic Algorithms in Real-Time Imprecise Computing

Leo Budin, Domagoj Jakobovi�, Marin Golub
2000 Journal of Computing and Information Technology  
This article describes the use of genetic algorithms in real-time systems that employ the imprecise computation paradigm.  ...  They can be used as a part of a real-time system, especially for optimizing tasks where the classical algorithms are not applicable or its computational time proves to be too expensive.  ...  Scheduling such a system to minimize total error has proved itself to be very demanding.  ... 
doi:10.2498/cit.2000.03.07 fatcat:acj4m24ryjfqlpux6axz3m2mqq

Competitive on-line scheduling of imprecise computations

S.K. Baruah, M.E. Hickey
1998 IEEE transactions on computers  
The on-line scheduling of systems of imprecisecomputation tasks is investigated. The system objective is to maximize the value obtained. A formal model is de ned.  ...  It is proven, however, that an on-line algorithm may in general perform arbitrarily poorly as compared to a clairvoyant scheduler.  ...  Thanks, too, to the anonymous referees for helpful suggestions, particularly regarding the organization of this document.  ... 
doi:10.1109/12.713322 fatcat:zofucflbtbbldj4vab2q4oqsiu

Energy-Aware Scheduling of Task Graphs with Imprecise Computations and End-to-End Deadlines [article]

Amirhossein Esmaili, Mahdi Nazemi, Massoud Pedram
2019 arXiv   pre-print
This work proposes a method for scheduling task graphs with potentially imprecise computations, with the goal of maximizing the quality of service subject to a hard deadline and an energy bound.  ...  Imprecise computations provide an avenue for scheduling algorithms developed for energy-constrained computing devices by trading off output quality with the utilization of system resources.  ...  We seek to schedule a task graph with the possibility of imprecise computations represented by G(V , E,T d ) on a platform comprising of K homogeneous processors in order to maximize QoS subject to a  ... 
arXiv:1905.04391v1 fatcat:z5r66qnwgjcu7kgqhodtnkdtxu

Algorithms for scheduling real-time tasks with input error and end-to-end deadlines

Wu-Chun Feng, J.W.-S. Liu
1997 IEEE Transactions on Software Engineering  
applications, scheduling, imprecise computation, error, end-to-end timing constraints. ----------3 ----------  ...  At the high level, the composite tasks are scheduled preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks.  ...  Shih and Liu [12] has since modified this algorithm to schedule tasks on-line so that the sum of the amounts of discarded work of all tasks accepted by the system is minimized.  ... 
doi:10.1109/32.585499 fatcat:hstteizgbzbllnzkejhnymcnnq

Supporting Deliberative Real-Time AI Systems: A Fixed Priority Scheduling Approach

Yanching Chu, Alan Burns
2007 Real-Time Systems (ECRTS), Proceedings of the Euromicro Workshop on  
An exact schedulability, based on a simple offset between the Prologue and Epilogue components, is devised but shown to be computationally prohibitive when a large number of imprecise tasks are present  ...  In this thesis it was shown that by employing a hybrid task model, for imprecise computation of the form "Prologue-Optional-Epilogue", a variety of AI algorithms with different hard and optional (anytime  ...  /sporadic/aperiodic, error-minimizing/reward-maximizing and bounded/unbounded imprecise computation.  ... 
doi:10.1109/ecrts.2007.32 dblp:conf/ecrts/ChuB07 fatcat:ayfinirilbdxrhdjv5qc4wjyhu

A New Scheduling Algorithm Based On Traffic Classification Using Imprecise Computation

Farzad Abtahi, Sahar Khanmohamadi, Bahram Sadeghi Bigham
2008 Zenodo  
Many packet scheduling algorithms have been proposed for wireless networks to guarantee fairness and delay bounds.  ...  In this paper, it is proposed a scheduling algorithm that takes traffic types of flows into consideration when scheduling packets and also it is provided scheduling flexibility by trading off video quality  ...  in real-time scheduling based on imprecise computation.  ... 
doi:10.5281/zenodo.1071272 fatcat:gcazwbzx6jbczg7aocsg3yj7s4

Specification and management of QoS in real-time databases supporting imprecise computations

M. Amirijoo, J. Hansson, S.H. Son
2006 IEEE transactions on computers  
Imprecise computation techniques address this problem and allow graceful degradation during overloads.  ...  In this paper, we present a framework for QoS specification and management consisting of a model for expressing QoS requirements, an architecture based on feedback control scheduling, and a set of algorithms  ...  ACKNOWLEDGMENTS This work was funded, in part by CUGS (the National Graduate School in Computer Science, Sweden), CENIIT (Center for Industrial Information Technology) under contract 01.07, and US National  ... 
doi:10.1109/tc.2006.45 fatcat:ke5rdgeodnh6lk2viv4mfk4yqa

Incorporating imprecise computation into system-level design of application-specific heterogeneous multiprocessors

Yosef G. Tirat-Gefen, Diogenes C. Silva, Alice C. Parker
1997 Proceedings of the 34th annual conference on Design automation conference - DAC '97  
This paper introduces a basic mixed integer-linear model MILP to design applicationspeci c heterogeneous multiprocessors ASHM allowing imprecise computation of tasks executed in a non-preemptive mode.  ...  The proposed model was used in the development of a genetic algorithm integrated into the tool set MEGA that uses soft computing techniques for design of optimal near-optimal ASHMs subject to constraints  ...  This MILP model is used to derive a genetic algorithm for nding an optimal near-optimal design. proposed an approach to minimize the total error, where the error of a task being imprecisely executed is  ... 
doi:10.1145/266021.266035 dblp:conf/dac/Tirat-GefenSP97 fatcat:sokgi2kp75dldkmsbvo6sd6k5m
« Previous Showing results 1 — 15 out of 13,007 results