{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:24Z","timestamp":1740122364049,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T00:00:00Z","timestamp":1532390400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100014188","name":"MSIT","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10586-018-2832-5","type":"journal-article","created":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T05:18:14Z","timestamp":1532409494000},"page":"373-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Async-LCAM: a lock contention aware messenger for Ceph distributed storage system"],"prefix":"10.1007","volume":"22","author":[{"given":"Bodon","family":"Jeong","sequence":"first","affiliation":[]},{"given":"Awais","family":"Khan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0309-1820","authenticated-orcid":false,"given":"Sungyong","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"key":"2832_CR1","unstructured":"IDC. \n https:\/\/www.ibm.com\/blogs\/internet-of-things\/ai-future-iot\/"},{"key":"2832_CR2","unstructured":"Weil, S.A., Brandt, S.A., Miller, E.L., Long, D.D., Maltzahn, C.: Ceph: a scalable, high-performance distributed file system. In: 7th Symposium on Operating Systems Design and Implementation, USENIX Association, pp. 307\u2013320 (2006)"},{"key":"2832_CR3","unstructured":"Gluster. \n http:\/\/www.gluster.org\/"},{"key":"2832_CR4","unstructured":"Lustre. \n http:\/\/lustre.org\/"},{"key":"2832_CR5","doi-asserted-by":"crossref","unstructured":"Ling, Y., Mullen, T., Lin, X.: Analysis of optimal thread pool size. In: ACM SIGOPS Operating Systems Review, vol. 34, no. 2, April 2000, pp. 42\u201355 (2000)","DOI":"10.1145\/346152.346320"},{"key":"2832_CR6","unstructured":"Fio Benchmark. \n http:\/\/freecode.com\/projects\/fio"},{"key":"2832_CR7","doi-asserted-by":"crossref","unstructured":"Noel, R.R., Lama, P.: Taming performance hotspots in cloud storage with dynamic load redistribution. In: 2017 IEEE 10th International Conference on Cloud Computing (CLOUD). IEEE, pp. 42\u201349 (2017)","DOI":"10.1109\/CLOUD.2017.15"},{"key":"2832_CR8","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Kandula, S., Stoica, I.: Leveraging endpoint flexibility in data-intensive clusters. In: ACM SIGCOMM Computer Communication Review. ACM, pp. 231\u2013242 (2013)","DOI":"10.1145\/2534169.2486021"},{"key":"2832_CR9","doi-asserted-by":"crossref","unstructured":"Kettimuthu, R., Vardoyan, G., Agrawal, G., Sadayappan, P., Foster, I.: An elegant sufficiency: load-aware differentiated scheduling of data transfers. In: 2015 SC-International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, pp. 1\u201312 (2015)","DOI":"10.1145\/2807591.2807660"},{"key":"2832_CR10","doi-asserted-by":"crossref","unstructured":"Kim, Y., Atchley, S., Vallee, G.R., Lee, S., Shipman, G.M.: Optimizing end-to-end big data transfers over terabits network infrastructure. In: IEEE Transactions on Parallel and Distributed Systems, pp. 188\u2013201 (2017)","DOI":"10.1109\/TPDS.2016.2550439"},{"key":"2832_CR11","unstructured":"Kumar, K., Rajiv, P., Laxmi, G., Bhuyan, N.: Shuffling: a framework for lock contention aware thread scheduling for multicore multiprocessor systems. In: 2014 23rd International Conference on Parallel Architecture and Compilation Techniques (PACT). IEEE, pp. 289\u2013300 (2014)"},{"key":"2832_CR12","doi-asserted-by":"crossref","unstructured":"Xian, F., Srisaan, W., Jiang, H.: Contention-aware scheduler: unlocking execution parallelism in multithreaded java programs. In: ACM Sigplan Notices. ACM, pp. 163\u2013180 (2008)","DOI":"10.1145\/1449955.1449778"},{"key":"2832_CR13","doi-asserted-by":"crossref","unstructured":"Han, Y., Lee, K., Park, S.: A Dynamic Message-aware Communication Scheduler for Ceph Storage System. In: IEEE International Workshops on Foundations and Applications of Self* Systems. IEEE, pp. 60\u201365 (2016)","DOI":"10.1109\/FAS-W.2016.25"},{"key":"2832_CR14","doi-asserted-by":"crossref","unstructured":"Song, U., Jeong, B., Park, S., Lee, K.: Performance optimization of communication subsystem in scale-out distributed storage. In: 2017 IEEE 2nd International Workshops on Foundations and Applications of Self*Systems (FAS* W). IEEE, pp. 263\u2013268 (2017)","DOI":"10.1109\/FAS-W.2017.157"},{"key":"2832_CR15","unstructured":"Provos, N., Lever, C.: Scalable network I\/O in linux. In: USENIX Annual Technical Conference, FREENIX Track (2000)"},{"key":"2832_CR16","unstructured":"Chandra, A., Mosberger, D.: Scalability of linux event-dispatch mechanisms. In: USENIX Annual Technical Conference, Boston(2001)"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2832-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-2832-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2832-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T21:44:39Z","timestamp":1589924679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-2832-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,24]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["2832"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-2832-5","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2018,7,24]]},"assertion":[{"value":"19 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}