Two Methodes to Release a New Real-time Task
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 1
Abstract
In some real-time systems, sometimes there is a need to insert a new task at run time. If the system is fully loaded, the scheduler has to compress one or more current tasks to free some bandwidth. Naturally, finding the earliest time to start the insertion without deadline missing is interesting, which is still under investigation. Instead of this, this paper discusses how to do the compression and insertion to make the insertion as early as possible, based on the conclusions in the published literature with the earliest deadline first algorithm(EDF). By introducing the instance remaining bandwidth(RB), an algorithm called maximum remaining bandwidth compression(MRBC) is provided to choose a proper task as the compressed one. An associated theorem and its lemma are also provided, which declares that the safety adjustment can be implemented immediately upon request if the increase of the bandwidth due to insertion does not exceed the lowest utilization of individual current tasks in the system and if every task is allowed to be compressed. Another algorithm named part utilization first(PUF) is also proposed, according to which a new task is inserted with a lower speed first, then to its full utilization after a certain time.
Authors and Affiliations
Guangming Qian , Xianghua Chen , Gang Yao
MODELING ORDINARY DIFFERENTIAL EQUATIONS IN MATLAB SIMULINK ®
Ordinary differential equations (ODEs) play a vital role in engineering problems. They are used to model continuous dynamical systems as initial and boundary value problems. There are several analytical and numerical met...
COMPARISON OF PURITY AND ENTROPY OF K-MEANS CLUSTERING AND FUZZY C MEANS CLUSTERING
Clustering is one the main area in data mining literature. There are various algorithms for clustering. The evaluation of the performance is done by validation measures. The external validation measures are used to measu...
THE MAIN FEATURE FOR SUCCESSFUL IMPLEMENTATION A DATA WAREHOUSE
Data warehousing is the leading and most reliable technology used today by companies for planning, forecasting, and management A lot has been done in this field regarding design and development of data warehouses and a l...
An Implementation of Integer Programming Techniques in Clustering Algorithm
This paper mainly deals with the analysis of IPP in clustering. Clustering is exemplified by the unsupervised learning of patterns and clusters that may exist in a given database and is a useful tool for Knowledge Discov...
TEXT CATEGORIZATION USING QLEARNING ALOGRITHM
This paper aims at creation of an efficient document classification process using reinforcement learning, a branch of machine learning that concerns itself with optimal sequential decision-making. One strength of reinfor...