Optimal data placement in two-headed disk systems

Manolopoulos, Y; Kollias J(Y) G,

dc.contributor.author	Manolopoulos, Y	en
dc.contributor.author	Kollias J(Y) G,	en
dc.date.accessioned	2014-03-01T01:08:06Z
dc.date.available	2014-03-01T01:08:06Z
dc.date.issued	1990	en
dc.identifier.issn	0006-3835	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10272
dc.subject	Algorithms	en
dc.subject	Camel arrangement	en
dc.subject	D.4.2	en
dc.subject	Data placement	en
dc.subject	Organ-pipe arrangement	en
dc.subject	Performance	en
dc.subject	Seek distance	en
dc.subject	Two-headed disk	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.subject.classification	Mathematics, Applied	en
dc.title	Optimal data placement in two-headed disk systems	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/BF02017343	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BF02017343	en
heal.language	English	en
heal.publicationDate	1990	en
heal.abstract	A problem inherent to the performance of disk systems is the data placement in cyinders in such a way that the seek time is minimized. If successive searchers are independent, then the optimal placement for conventional one-headed disk systems is the organ-pipe arrangement. According to this arrangement the most frequent cylinder is placed in the central location, while the less frequent cylinders are placed right and left alternatively. This paper proves that the optimal placement for two-headed disk systems is the ""camel"" arrangement, which may be viewed as two consecutive organ-pipe arrangements. It is also proved that, for a two-headed disk system with N=2(2 n+1) cylinders, the total number of these optimal camel arrangements is exp2 (N/2+1). © 1990 BIT Foundations.	en
heal.publisher	Kluwer Academic Publishers	en
heal.journalName	BIT	en
dc.identifier.doi	10.1007/BF02017343	en
dc.identifier.isi	ISI:A1990DT08800004	en
dc.identifier.volume	30	en
dc.identifier.issue	2	en
dc.identifier.spage	216	en
dc.identifier.epage	219	en