FA
Today, Saturday، 27 Apr 2024 - 09:32
Mokhafaf

Acronym Finder

TFC
What is TFC ?
Total Fixed Cost
Fixed fee total financial management is used....
MA
What is MA ?
Moving Average
Typical average is that of economic and financial Sciences used....
IXD
What is IXD ?
Interaction Design
Interaction design (IxD) is a design system for Interactive (Interactive) to support the ways that people in their everyday lives to communicate and interact to fall. Except this, the design of the interaction, the "design of spaces for interactions and human communication," and "the hows and how the daily interactions we have with computers" also have been defined.

interaction design is trying to consider the offer functionality, etc., products so design that use them - from a user perspective - comfortable, efficient, and pleasant. The target interaction design, etc. improve the quality of the user experience.

the term "interaction design" is a term bangs is that aspects of the various design covers, including: design, user interface design, software design, user-centered, design product, web design, and the design of the system dialog. Since the design of the interaction, a skill is interdisciplinary, specialists in this field should be of a variety of dating. including: the psychology of., the ergonomics, design, industrial, library and Information Science, etc. graphics, Informatics, etc....
IDA
What is IDA ?
Incremental Dynamic Analysis
Dynamic analysis incremental...
HRRN
What is HRRN ?
Highest Response Ratio Next
Algorithm schedule HRRN typical schedule is exclusively that some of the problems SJF to fix makes. In the Rolling Stone comment extreme well than, short, and conversely the extreme bad compared to the long tasks there, so that might be the problem, the Famine of frostbite occur. In this schedule, priorities dynamics.
things shorter preference greater and earlier execution. Things long as well that a lot of time in the queue have been expecting preferences more in a given time execution. Thus, the problem of famine, Frost, relieved....
RR
What is RR ?
Round Robin
The scheduler turns the circulation RR is one of The the most simple , the most fair, the most and the most common algorithms of the scheduler is of the type of non-exclusive (preemptive). This algorithm like FCFS, but to any processing, the maximum amount of time a specific CPU is given.

In other words, a small unit time, called a quantum of time (time quantum) , cutting time (time slice) is defined, which is usually between 10 to 100ml H, and each process maximum to the amount of could be the CPU, at the discretion of the government. When processing CPU's at its disposal may occur .

or the explosion of computing the current is less than a quantum time is that in this mode the processing of voluntary CPU release and does not wait for completion of operation I/O can be (like FCFS) or that the explosion of computing is more of a quantum is when in this mode, the timer a interrupt to the operating system and gives the operating system with the replacement text (Context switch) CPU from processing the current and taken it to the bottom of The sends, then from the beginning of the queue ready, The processing of another's direction of run pick :

from this method in systems share time used, until the Times of response to users dialog as appropriate the warranty.

the upper limit of the quantum time its so is the response time good.
far down the cutting time by a factor of two is determined by the one that have the cut much larger than the switching time of the text is, for example, thousands of times.
the other thing is that the amount of cutting time should be slightly larger than the time necessary for a interplay, somehow be, because otherwise every, little need to have several cutting time will be the efficiency of the system due to replacement of text in multiple low.

a good rule of thumb is that the go % blasts computing should be shorter than quantum, when they are in operation for: would cut the time to approximately 100 milliseconds in the fall....
SRT
What is SRT ?
Shortest Remained Time
Algorithm SRT is one of the simplest algorithms and scheduling, but useful.

with each interruption, the arrival process to the queue of process ready (transition to Ready, Ready) service time processes are compared (with the algorithm, an estimate or that of before, a characteristic that very little comes up), and the process with the highest service time choice and run it. run the process for the exclusive (non-pre) continue to tick up, make a pause, etc. algorithms, scheduling pitch....