Evenly Distributing Combinatorial Tasks in a Peer-to-Peer System

Title
Evenly Distributing Combinatorial Tasks in a Peer-to-Peer System
Authors
김수현김래현
Keywords
combination; distributed computing; parallelizable peer-to-peer application; load balancing
Issue Date
2010-05
Publisher
The Fifth International Conference on Internet and Web Applications and Services
Citation
, 213-216
Abstract
This paper presents an algorithm to evenly distribute a combinatorial task to participating nodes in a peer-to-peer system. Subtasks divided by our algorithm can be independently computed and the size of each subtask is almost identical so that we can achieve optimal resource utilization, maximize throughput, minimize response time, and avoid unfair overload to some nodes. An algorithm to find similarity among user-generated contents is used as an example of combinatorial tasks. Using a realworld data obtained from YouTube contents, we measured the reduction in processing time achievable by cooperation with other peers in a peer-to-peer environment. The result shows that the processing time for combination tasks can be significantly reduced as the number of peers to accomplish the tasks is increased.
URI
http://pubs.kist.re.kr/handle/201004/38497
Appears in Collections:
KIST Publication > Conference Paper
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE