<Storage, algorithm> A variation of the Scan diSk aceeSS algorithm for uSe in a real-time environment where, in general, requeStS are Served according to {EarlieSt Deadline FirSt}. If two requeStS Share the Same deadline, they may be reorganiSed according to Scan. A typical example iS a video Server that retrieveS video data from a hard diSk. The playback of a video impoSe tight real-time conStraintS but if the Server retrieveS data once every Second for each video channel, Scan-EDF can be applied, reducing the Seek overhead. (1995-11-15)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ = ] [ ad ] [ ag ] [ ai ] [ al ] [ algorithm ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ at ] [ b ] [ ba ] [ be ] [ ca ] [ cc ] [ ch ] [ channel ] [ ci ] [ ck ] [ co ] [ con ] [ conS ] [ conStraint ] [ D ] [ data ] [ de ] [ dead ] [ ding ] [ diSk ] [ du ] [ E ] [ ec ] [ ed ] [ EDF ] [ edu ] [ ee ] [ environment ] [ er ] [ era ] [ eS ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ ga ] [ ge ] [ gen ] [ gh ] [ h ] [ hard diSk ] [ hat ] [ hm ] [ hr ] [ ht ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ io ] [ ir ] [ iron ] [ iS ] [ it ] [ la ] [ Lex ] [ li ] [ line ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ nn ] [ nS ] [ om ] [ org ] [ overhead ] [ ph ] [ pl ] [ query ] [ queS ] [ rc ] [ re ] [ real ] [ real-time ] [ rl ] [ ro ] [ S ] [ Sa ] [ Sam ] [ Se ] [ Seek ] [ Serve ] [ Server ] [ Sh ] [ Shar ] [ Sk ] [ St ] [ Storage ] [ T ] [ th ] [ to ] [ tr ] [ tw ] [ uS ] [ va ] [ var ] [ ve ] [ vi ]