{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:16:18Z","timestamp":1729646178305,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1109\/inm.2011.5990675","type":"proceedings-article","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T11:57:47Z","timestamp":1314273467000},"page":"65-72","source":"Crossref","is-referenced-by-count":1,"title":["Run-time performance optimization and job management in a data protection solution"],"prefix":"10.1109","author":[{"given":"Ludmila","family":"Cherkasova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Lau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harald","family":"Burose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subramaniam Venkata","family":"Kalambur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Kappler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuttiraja","family":"Veeranan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2006","author":"preston","journal-title":"Backup & Recovery","key":"19"},{"key":"17","article-title":"Sparse indexing: Large scale, inline deduplication using sampling and locality","author":"lillibridge","year":"2009","journal-title":"Proc of FAST 2009"},{"year":"2003","journal-title":"Magnetic Tape Whither Thou Goest? White Paper META Delta","key":"18"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1145\/762483.762486"},{"year":"0","journal-title":"IBM Tivoli Continuous Data Protection for Files","key":"16"},{"year":"0","journal-title":"HP Data Protector","key":"13"},{"year":"0","journal-title":"HP Data Protector Advanced Backup to Disk Integration with Virtual Tape Libraries","key":"14"},{"year":"0","author":"fitzpatrick","journal-title":"Brackup","key":"11"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1137\/0117039"},{"year":"0","journal-title":"Veritas NetBackup","key":"21"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1016\/j.ipl.2004.04.009"},{"key":"22","article-title":"Venti: A new approach to archival storage","author":"quinlan","year":"2002","journal-title":"Proc FAST 2002 USENIX Conference on File and Storage Technologies"},{"key":"23","article-title":"Dynamic task assignment in server farms: Better performance by task grouping","author":"tan","year":"2002","journal-title":"Proc Intl Symp Computers and Comm (ISCC)"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.1145\/1629080.1629084"},{"doi-asserted-by":"publisher","key":"25","DOI":"10.1145\/781027.781057"},{"key":"26","article-title":"Largest-job-first-scan-all scheduling policy for 2D mesh-connected systems","author":"yoo","year":"1996","journal-title":"Proceedings 2nd Symposium on the Frontiers of Massively Parallel Computation"},{"doi-asserted-by":"publisher","key":"27","DOI":"10.1109\/ICDE.2005.47"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1137\/S0097539793259471"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1145\/301970.301974"},{"year":"2002","journal-title":"EMC Centera Content addressed storage system","key":"10"},{"year":"0","journal-title":"The Automated Maryland Automatic Network Disk Archiver","key":"1"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/MASCOT.2009.5367043"},{"key":"6","article-title":"Approximation algorithms for minimizing average weighted completion time","author":"chekuri","year":"2004","journal-title":"Handbook of Scheduling Algorithms Models and Performance Analysis"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-69346-7_29","article-title":"An efficient approximation algorithm for minimizing makespan on uniformly related machines","author":"chekuri","year":"1998","journal-title":"Proc of the 6th Conf on Integer Programming & Combinatorial Optimization (IPCO'98)"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1145\/324133.324234"},{"year":"0","key":"9"},{"key":"8","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0037157","article-title":"Scheduling strategy to improve response time for web applications","volume":"1401","author":"cherkasova","year":"1998","journal-title":"Proc on High Performance Computing and Networking (HPCN'98)"}],"event":{"name":"2011 IFIP\/IEEE International Symposium on Integrated Network Management (IM 2011)","start":{"date-parts":[[2011,5,23]]},"location":"Dublin, Ireland","end":{"date-parts":[[2011,5,27]]}},"container-title":["12th IFIP\/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5976317\/5990489\/05990675.pdf?arnumber=5990675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T01:10:25Z","timestamp":1497921025000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5990675\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/inm.2011.5990675","relation":{},"subject":[],"published":{"date-parts":[[2011,5]]}}}