完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLee, Ming-Changen_US
dc.contributor.authorLeu, Fang-Yieen_US
dc.contributor.authorChen, Ying-pingen_US
dc.date.accessioned2017-04-21T06:48:14Z-
dc.date.available2017-04-21T06:48:14Z-
dc.date.issued2015en_US
dc.identifier.isbn978-1-4673-6563-5en_US
dc.identifier.issn0730-3157en_US
dc.identifier.urihttp://dx.doi.org/10.1109/COMPSAC.2015.34en_US
dc.identifier.urihttp://hdl.handle.net/11536/136478-
dc.description.abstractIn this paper we propose a novel co-allocation scheme, called a Reliable Multicast Brute-Force co-allocation scheme (ReMBF for short), which employs a reliable multicast (RM for short) technique with the Brute-Force (BF for short) scheme to accelerate data retrieval and delivery, and reliably transmit data to its users for data grids. Several types of data access patterns, including Zipf-like, geometric, and uniform distributions, are utilized to model user access behaviors and evaluate the performance of ReMBF. The simulation results demonstrate that ReMBF can efficiently deliver a bulk of data in a shorter time period compared with two state-of-the-art schemes.en_US
dc.language.isoen_USen_US
dc.subjectdata gridsen_US
dc.subjectco-allocation schemeen_US
dc.subjectreliable multicasten_US
dc.subjectbrute-forceen_US
dc.subjectmulti-user perspectivesen_US
dc.titleReMBF: A Reliable Multicast Brute-Force Co-Allocation Scheme for Multi-user Data Gridsen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/COMPSAC.2015.34en_US
dc.identifier.journal39TH ANNUAL IEEE COMPUTERS, SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC 2015), VOL 2en_US
dc.citation.spage774en_US
dc.citation.epage783en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000380584300104en_US
dc.citation.woscount0en_US
顯示於類別:會議論文