{"_id":"2214","status":"public","publication":"IEEE International Conference on Distributed Computing Systems (ICDCS)","author":[{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"last_name":"Effert","first_name":"Sascha","full_name":"Effert, Sascha"},{"first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"citation":{"apa":"Brinkmann, A., Effert, S., Meyer auf der Heide, F., &#38; Scheideler, C. (2007). Dynamic and redundant data placement. <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>.","mla":"Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>, 2007.","ama":"Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant data placement. In: <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>. ; 2007.","ieee":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic and redundant data placement,” 2007.","short":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.","bibtex":"@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic and redundant data placement}, booktitle={IEEE International Conference on Distributed Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }","chicago":"Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Dynamic and Redundant Data Placement.” In <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>, 2007."},"has_accepted_license":"1","file":[{"file_name":"ICDCS07.pdf","file_id":"2339","file_size":164121,"content_type":"application/pdf","date_updated":"2018-04-13T10:01:42Z","relation":"main_file","date_created":"2018-04-13T10:01:42Z","creator":"florida","access_level":"open_access"}],"ddc":["040"],"abstract":[{"lang":"eng","text":"We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices."}],"language":[{"iso":"eng"}],"user_id":"15415","type":"conference","date_updated":"2022-01-06T06:55:27Z","urn":"22147","date_created":"2018-04-05T07:08:35Z","file_date_updated":"2018-04-13T10:01:42Z","year":"2007","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","title":"Dynamic and redundant data placement"}