Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Ian M. Sutherland"'
Autor:
Ian M. Sutherland, Eric J. Schwabe
Publikováno v:
Journal of Computer and System Sciences. 81:671-691
Disk arrays allow faster access to users' data by distributing the data among a collection of disks and allowing parallel access. Fault tolerance in a disk array can be achieved by using a data layout, and the technique of parity declustering allows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6eb11152005f7ab15f0681af41d692da
https://doi.org/10.1016/j.jcss.2014.11.013
https://doi.org/10.1016/j.jcss.2014.11.013
Autor:
Ian M. Sutherland, Eric J. Schwabe
Publikováno v:
COCOON
The joint demands of high performance and fault tolerance in a large array of disks can be satisfied by a parity-declustered data layout. Such a data layout is generated by partitioning the data on the disks into stripes and choosing a part of each s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd64f57c3ef93a62aa2b3a3d61f26dee
https://doi.org/10.1016/j.tcs.2004.02.042
https://doi.org/10.1016/j.tcs.2004.02.042
Autor:
Ian M. Sutherland, Eric J. Schwabe
Publikováno v:
Theory of Computing Systems. 32:561-587
It is well known that dedicating one disk's worth of space in a disk array to parity check information can allow the array to tolerate a single failure. More recently, two possible ways of increasing that benefit through the use of additional redunda
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6011b46297440a64e059478891817b9
https://doi.org/10.1007/s002240000132
https://doi.org/10.1007/s002240000132
Autor:
Ian M. Sutherland
Publikováno v:
Worlds Apart?: Disability and Foreign Language Learning
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8b840dd77c816fe99c4036970d7b85d
https://doi.org/10.12987/yale/9780300116304.003.0003
https://doi.org/10.12987/yale/9780300116304.003.0003
Autor:
Eric J. Schwabe, Ian M. Sutherland
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540405344
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2aad6a0c6cc8a162e9322ad8a23a40b6
https://doi.org/10.1007/3-540-45071-8_27
https://doi.org/10.1007/3-540-45071-8_27
Publikováno v:
IOPADS
Parity-declustered data layouts were developed to reduce the time for on-line failure recovery in disk arrays. They generally require perfect balancing of reconstruction workload among the disks; this restrictive balance condition makes such data lay
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e892079d237df52741e84ac3aebc4e5e
https://doi.org/10.1145/236017.236031
https://doi.org/10.1145/236017.236031
Autor:
Ian M. Sutherland, Eric J. Schwabe
Publikováno v:
SPAA
Recently, parity-declustered layouts have been studied as a tool for reducing the time needed to reconstruct a failed disk in a disk array. Construction of such layouts for large disk arrays generally involves the use of a balanced incomplete block d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31ecfa2de43c87784b105eb9458c4394
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.