Title :
RESCOT: Reliable Scheduling of Social Computing Tasks
Author_Institution :
Dept. of Comput. Sci., Univ. of Koblenz, Koblenz, Germany
Abstract :
Scalable processing of Human Computing tasks by large pools of community members is one of the key opportunities of the modern Social Web. However, the self-organizing nature of Web communities does not allow for guarantees of user commitment and output quality. This is a serious drawback, especially for applications with continuously arriving input data (e.g. reviews and assessments in social streams). On the other hand, greedy replication of all tasks results in a high demand for human resources and - in case of monetary models - in rapidly growing costs. This paper aims to exploit the tradeoff between redundancy of task assignments and guarantees of successful task completion in the context of human computing. We introduce the probabilistic predictive model that allows for flexible tuning of induced redundancy of assignments, with respect to the estimated failure rates of invoked users and the desired global quality of service.
Keywords :
probability; quality of service; scheduling; social networking (online); Web communities; global quality of service; greedy replication; human computing tasks; induced redundancy tuning; monetary model; probabilistic predictive model; reliable scheduling; social Web; social computing tasks; Communities; Humans; Predictive models; Probabilistic logic; Processor scheduling; Redundancy; Social network services; Social computing; human computing; probabilistic guarantees; redundancy; replication; scheduling;
Conference_Titel :
Privacy, Security, Risk and Trust (PASSAT) and 2011 IEEE Third Inernational Conference on Social Computing (SocialCom), 2011 IEEE Third International Conference on
Conference_Location :
Boston, MA
Print_ISBN :
978-1-4577-1931-8
DOI :
10.1109/PASSAT/SocialCom.2011.138