{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:11:23Z","timestamp":1725603083015},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229466"},{"type":"electronic","value":"9783642229473"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22947-3_11","type":"book-chapter","created":{"date-parts":[[2011,8,27]],"date-time":"2011-08-27T06:49:20Z","timestamp":1314427760000},"page":"120-134","source":"Crossref","is-referenced-by-count":3,"title":["CAD: An Efficient Data Management and Migration Scheme across Clouds for Data-Intensive Scientific Applications"],"prefix":"10.1007","author":[{"given":"Ching-Hsien","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Cuzzocrea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shih-Chang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"de Assuncao, M.D., di Costanzo, A., Buyya, R.: Evaluating the Cost-Benefit of Using Cloud Computing to Extend the Capacity of Clusters. In: Proceedings of the 18th ACM International Symposium on High Performance Distributed Computing, pp. 141\u2013150 (June 2009)","DOI":"10.1145\/1551609.1551635"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10951-006-0006-4","volume":"10","author":"P. Baptiste","year":"2007","unstructured":"Baptiste, P., Brucker, P., Chrobak, M., D\u00fcrr, C., Kravchenko, S.A., Sourd, F.: The Complexity of Mean Flow Time Scheduling Problems with Release Times. Journal of Scheduling\u00a010(2), 139\u2013146 (2007)","journal-title":"Journal of Scheduling"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10951-008-0063-y","volume":"11","author":"P. Brucker","year":"2008","unstructured":"Brucker, P., Kravchenko, S.A.: Scheduling Jobs with Equal Processing Times and Time Windows on Identical Parallel Machines. Journal of Scheduling\u00a011(4), 229\u2013237 (2008)","journal-title":"Journal of Scheduling"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1016\/j.future.2006.09.004","volume":"23","author":"E.J. Byun","year":"2007","unstructured":"Byun, E.J., Choi, S.J., Baik, M.S., Gil, J.M., Park, C.Y., Hwang, C.S.: MJSA: Markov Job Scheduler based on Availability in Desktop Grid Computing Environments. Future Generation Computer Systems\u00a023(4), 616\u2013622 (2007)","journal-title":"Future Generation Computer Systems"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Castillo, C., Rouskas, G.N., Harfoush, K.: Efficient Resource Management Using Advance Reservations for Heterogeneous Grids. In: Proceedings of 21st IEEE International Parallel and Distributed Processing, pp. 1\u201312 (April 2008)","DOI":"10.1109\/IPDPS.2008.4536228"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.future.2008.06.004","volume":"25","author":"R.-S. Chang","year":"2009","unstructured":"Chang, R.-S., Chang, J.-S., Lin, P.-S.: An Ant Algorithm for Balanced Job Scheduling in Grids. Future Generation Computer Systems\u00a025(1), 20\u201327 (2009)","journal-title":"Future Generation Computer Systems"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s11227-008-0221-1","volume":"49","author":"C.-W. Cheng","year":"2009","unstructured":"Cheng, C.-W., Wu, J.-J., Liu, P.: QoS-Aware, Access-Efficient, and Storage-Efficient Replica Placements. Journal of Supercomputing\u00a049(1), 42\u201363 (2009)","journal-title":"Journal of Supercomputing"},{"issue":"10","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/TPDS.2006.141","volume":"17","author":"J. Cohen","year":"2006","unstructured":"Cohen, J., Jeannot, E., Padoy, N., Wagner, F.c.: Messages Scheduling for Parallel Data Redistribution between Clusters. IEEE Transactions on Parallel and Distributed Systems\u00a017(10), 1163\u20131175 (2006)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-10665-1_40","volume-title":"Cloud Computing","author":"N.G. Grounds","year":"2009","unstructured":"Grounds, N.G., Antonio, J.K., Muehring, J.: Cost-Minimizing Scheduling of Workflows on a Cloud of Memory Managed Multicore Machines. In: Jaatun, M.G., Zhao, G., Rong, C. (eds.) Cloud Computing. LNCS, vol.\u00a05931, pp. 435\u2013450. Springer, Heidelberg (2009)"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1024262610201","volume":"25","author":"M. Guo","year":"2003","unstructured":"Guo, M., Pan, Y., Liu, Z.: Symbolic Communication Set Generation for Irregular Parallel Applications. The Journal of Supercomputing\u00a025(3), 199\u2013214 (2003)","journal-title":"The Journal of Supercomputing"},{"issue":"12","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1109\/71.895789","volume":"11","author":"C.-H. Hsu","year":"2000","unstructured":"Hsu, C.-H., Bai, S.-W., Chung, Y.-C., Yang, C.-S.: A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution. IEEE Transactions on Parallel and Distributed Systems\u00a011(12), 1201\u20131216 (2000)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"11","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TPDS.2006.162","volume":"17","author":"C.-H. Hsu","year":"2006","unstructured":"Hsu, C.-H., Chen, M.-H., Yang, C.-T., Li, K.-C.: Optimizing Communications of Dynamic Data Redistribution on Symmetrical Matrices in Parallelizing Compilers. IEEE Transactions on Parallel and Distributed Systems\u00a017(11), 1226\u20131241 (2006)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s11227-006-0024-1","volume":"40","author":"C.-H. Hsu","year":"2007","unstructured":"Hsu, C.-H., Chen, S.-C., Lan, C.-Y.: Scheduling Contention-Free Irregular Redistributions in Parallelizing Compilers. The Journal of Supercomputing\u00a040(3), 229\u2013247 (2007)","journal-title":"The Journal of Supercomputing"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s11227-007-0166-9","volume":"45","author":"J.-W. Huang","year":"2008","unstructured":"Huang, J.-W., Chu, C.-P.: A Flexible Processor Mapping Technique toward Data Localization for Block-Cyclic Data Redistribution. The Journal of Supercomputing\u00a045(2), 151\u2013172 (2008)","journal-title":"The Journal of Supercomputing"},{"issue":"4","key":"11_CR15","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1177\/1094342006068407","volume":"20","author":"E. Jeannot","year":"2006","unstructured":"Jeannot, E., Wagner, F.: Scheduling Messages for Data Redistribution: An Experimental Study. The International Journal of High Performance Computing Applications\u00a020(4), 443\u2013454 (2006)","journal-title":"The International Journal of High Performance Computing Applications"},{"issue":"6","key":"11_CR16","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/71.932716","volume":"12","author":"K. Kalpakis","year":"2001","unstructured":"Kalpakis, K., Dasgupta, K., Wolfson, O.: Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs. IEEE Transactions on Parallel and Distributed Systems\u00a012(6), 628\u2013637 (2001)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"10","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1016\/j.jpdc.2005.04.014","volume":"65","author":"A. Karwande","year":"2005","unstructured":"Karwande, A., Yuan, X., Lowenthal, D.K.: An MPI Prototype for Compiled Communication on Ethernet Switched Clusters. Journal of Parallel and Distributed Computing\u00a065(10), 1123\u20131133 (2005)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-13067-0_31","volume-title":"Advances in Grid and Pervasive Computing","author":"P.-Y. Lin","year":"2010","unstructured":"Lin, P.-Y., Liu, P.: Job Scheduling Techniques for Distributed Systems with Temporal Constraints. In: Bellavista, P., Chang, R.-S., Chao, H.-C., Lin, S.-F., Sloot, P.M.A. (eds.) GPC 2010. LNCS, vol.\u00a06104, pp. 280\u2013289. Springer, Heidelberg (2010)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Liu, H., Orban, D.: GridBatch: Cloud Computing for Large-Scale Data-Intensive Batch Applications. In: Proceedings of the 8th IEEE International Symposium on Cluster Computing and the Grid, May 2008, pp. 295\u2013304 (2008)","DOI":"10.1109\/CCGRID.2008.30"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/jpdc.1997.1351","volume":"45","author":"L. Prylli","year":"1997","unstructured":"Prylli, L., Touranchean, B.: Fast Runtime Block Cyclic Data Redistribution on Multiprocessors. Journal of Parallel and Distributed Computing\u00a045(1), 63\u201372 (1997)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"11_CR21","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1142\/S0129054106003814","volume":"17","author":"T. Rauber","year":"2006","unstructured":"Rauber, T., R\u00fcnger, G.: A Data Re-Distribution Library for Multi-Processor Task Programming. International Journal of Foundations of Computer Science\u00a017(2), 251\u2013270 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-74742-0_19","volume-title":"Parallel and Distributed Processing and Applications","author":"R. Sudarsan","year":"2007","unstructured":"Sudarsan, R., Ribbens, C.J.: Efficient Multidimensional Data Redistribution for Resizable Parallel Computations. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds.) ISPA 2007. LNCS, vol.\u00a04742, pp. 182\u2013194. Springer, Heidelberg (2007)"},{"key":"11_CR23","unstructured":"Tu, M., Li, P., Ma, Q., Yen, I.-L., Bastani, F.B.: On the Optimal Placement of Secure Data Objects over Internet. In: Proceedings of 19th IEEE International Parallel and Distributed Processing, pp. 14\u201314 (April 2005)"},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/B:SUPE.0000026848.34971.27","volume":"29","author":"H. Wang","year":"2004","unstructured":"Wang, H., Guo, M., Wei, D.: Divide-and-Conquer Algorithm for Irregular Redistribution in Parallelizing Compilers. The Journal of Supercomputing\u00a029(2), 157\u2013170 (2004)","journal-title":"The Journal of Supercomputing"},{"issue":"2","key":"11_CR25","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1093\/ietisy\/e89-d.2.418","volume":"E89-D","author":"H. Wang","year":"2006","unstructured":"Wang, H., Guo, M., Wei, D.: Message Scheduling for Irregular Data Redistribution in Parallelizing Compilers. IEICE Transactions on Information and Systems\u00a0E89-D(2), 418\u2013424 (2006)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Wee, S., Liu, H.: Client-Side Load Balancer using Cloud. In: Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 399\u2013405 (March 2010)","DOI":"10.1145\/1774088.1774173"},{"issue":"12","key":"11_CR27","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.1016\/j.jpdc.2008.08.002","volume":"68","author":"J.-J. Wu","year":"2008","unstructured":"Wu, J.-J., Lin, Y.-F., Liu, P.: Optimal Replica Placement in Hierarchical Data Grids with Locality Assurance. Journal of Parallel and Distributed Computing\u00a068(12), 1517\u20131538 (2008)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Yang, Y., Liu, K., Chen, J., Liu, X., Yuan, D., Jin, H.: An Algorithm in SwinDeW-C for Scheduling Transaction-Intensive Cost-Constrained Cloud Workflows. In: Proceedings of the 4th IEEE International Conference on eScience, pp. 374\u2013375 (December 2008)","DOI":"10.1109\/eScience.2008.93"},{"issue":"3","key":"11_CR29","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1015313917431","volume":"22","author":"H.-G. Yook","year":"2002","unstructured":"Yook, H.-G., Park, M.-S.: Scheduling GEN_BLOCK Array Redistribution. The Journal of Supercomputing\u00a022(3), 251\u2013267 (2002)","journal-title":"The Journal of Supercomputing"}],"container-title":["Lecture Notes in Computer Science","Data Management in Grid and Peer-to-Peer Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22947-3_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T11:39:45Z","timestamp":1620041985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22947-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229466","9783642229473"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22947-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}