Group-Sweeping Scheduling
< storage, algorithm> (G ss) A di sk scheduling strategy in which reque st s are served in cycle s, in a round-robin manner. To reduce di sk arm movement s (" seeking"), the set of stream s i s divided into group s that are served in fixed order. stream s within a group are served according to " sCAN". If all client s are a ssigned to one group, G ss reduce s to sCAN, and if all client s are a ssigned to separate group s, G ss effectively become s round-robin scheduling. The service order within one group i s not fixed, and a stream may in fact be fir st in one cycle while la st in the next. Thi s variation ha s to be ma sked by extra buffering but wherea s sCAN require s buffer space for all stream s, G ss can reu se the buffer for each group and effect a trade-off between seek optimisation and buffer requirement s. (1995-11-12) style="border-width:thin; border-color:#333333; border-style:dashed; padding:5px;" align="left">In addition suitable contents: [ 2 ] [ = ] [ ad ] [ ag ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ be ] [ bi ] [ buffer ] [ by ] [ C ] [ CA ] [ ca ] [ CAN ] [ cc ] [ ch ] [ cl ] [ client ] [ co ] [ com ] [ cy ] [ cycle ] [ de ] [ ding ] [ disk ] [ du ] [ ec ] [ ed ] [ edu ] [ ee ] [ eg ] [ er ] [ es ] [ et ] [ fact ] [ fi ] [ file ] [ fix ] [ fo ] [ for ] [ G ] [ ge ] [ gn ] [ gr ] [ group ] [ Gs ] [ Gss ] [ gy ] [ h ] [ hat ] [ hm ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ ke ] [ la ] [ Lex ] [ li ] [ ly ] [ ma ] [ man ] [ mo ] [ mod ] [ module ] [ ms ] [ N ] [ na ] [ ne ] [ ng ] [ nn ] [ no ] [ om ] [ op ] [ pa ] [ ph ] [ pt ] [ query ] [ ques ] [ rc ] [ re ] [ requirements ] [ reuse ] [ ro ] [ round-robin ] [ s ] [ sa ] [ sC ] [ sc ] [ sCA ] [ sCAN ] [ scheduling ] [ se ] [ seek ] [ serve ] [ service ] [ set ] [ si ] [ sig ] [ sk ] [ space ] [ st ] [ storage ] [ stream ] [ T ] [ th ] [ to ] [ tr ] [ tw ] [ up ] [ us ] [ va ] [ var ] [ ve ] [ vi ] [ while ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (4472 Reads) |