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
Keywords
Related Articles
- EP ID EP108586
- DOI -
- Views 158
- Downloads 0
LEAF COLOR, AREA AND EDGE FEATURES BASED APPROACH FOR IDENTIFICATION OF INDIAN MEDICINAL PLANTS
This paper presents a method for identification of medicinal plants based on some important features extracted from its leaf images. Medicinal plants are the essential aspects of ayurvedic system of medicine. The leaf ex...
Disorder Speech Clustering For Clinical Data Using Fuzzy C-Means Clustering And Comparison With SVM Classification
Speech is the most vital skill of communication. Stammering is speech which is hesitant, stumbling, tense or jerky to the extent that it causes anxiety to the speaker. In the existing system, there are many effective tre...
0-EDGE MAGIC LABELING FOR SOME CLASS OF GRAPHS
In this paper we introduce new labeling called 0-Edge Magic Labeling, and also shown the existence of this Labeling for Some Class of graphs.
SPEECH RECOGNITION USING GENERIC SHORTEST DISTANCE ALGORITHM
The first major contribution of this paper may well be a dialog model support propositional content and intentions. Two distinct components of the model square measure mentioned in depth: (a) associate approach to the mo...
Use of Prefix Trees in Text Error Correction Problem
A deformed fuzzy automaton can be used to calculate similarity value between strings having a nonlimited number of edition errors. In this paper an algorithm is presented that makes use of prefix tree to implement the de...