Empirical Analysis on Parallel Tasks in Crowdsourcing Software Development

被引:7
|
作者
Saremi, Razieh Lotfalian [1 ]
Yang, Ye [1 ]
机构
[1] Stevens Inst Technol, Sch Syst & Enterprises, Hoboken, NJ 07030 USA
来源
2015 30th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW) | 2015年
关键词
Parallelism; Software Worker; Tasks; Award; worker performance;
D O I
10.1109/ASEW.2015.22
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Crowdsourcing has become a popular option for rapid acquisition, with reported benefits such as shortened schedule due to mass parallel development, innovative solutions based on the "wisdom of crowds", and reduced cost due to the pre-pricing and bidding effects. However, most of existing studies on software crowdsourcing are focusing on individual task level, providing limited insights on the practice as well as outcomes at overall project level. To develop better understanding of crowdsourcing-based software projects, this paper reports an empirical study on analyzing four largest projects on Topcoder platform that intensively leverage crowdsourcing throughout the product implementation, testing, and assembly phases. The analysis results conclude that: (1) crowdsourcing task scheduling follows typical patterns including prototyping, component development, bug hunt, and assembly and coding (2) budget phase distribution patterns does not following traditional patterns, and uploading task rate is not representing same budget rate associated with them as about 75% of uploaded tasks would price under 67% of total project budget; (3) Higher degree of parallelism would lead to higher demand for competing on tasks and shorter planning schedule to complete the project consequently better resource allocation.
引用
收藏
页码:28 / 34
页数:7
相关论文
共 50 条
  • [1] Award vs. Worker Behaviors in Competitive Crowdsourcing Tasks
    Yang, Ye
    Saremi, Razieh Lotfalian
    2015 ACM/IEEE INTERNATIONAL SYMPOSIUM ON EMPIRICAL SOFTWARE ENGINEERING AND MEASUREMENT (ESEM), 2015, : 68 - 77
  • [2] Timing Analysis of Parallel Software Using Abstract Execution
    Gustavsson, Andreas
    Gustafsson, Jan
    Lisper, Bjoern
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION: (VMCAI 2014), 2014, 8318 : 59 - 77
  • [3] Leveraging Crowdsourcing For Team Elasticity: An Empirical Evaluation at TopCoder
    Saremi, Razieh L.
    Yang, Ye
    Ruhe, Guenther
    Messinger, David
    2017 IEEE/ACM 39TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING: SOFTWARE ENGINEERING IN PRACTICE TRACK (ICSE-SEIP 2017), 2017, : 103 - 112
  • [4] Experimental Analysis of the Tardiness of Parallel Tasks in Soft Real-Time Systems
    Qamhieh, Manar
    Midonnet, Serge
    JOB SCHEDULING STRATEGIES FOR PARALLEL PROCESSING (JSSPP 2014), 2015, 8828 : 36 - 52
  • [5] MATHEMATICAL TASKS WITH SOFTWARE IN BASIC EDUCATION
    Fonseca, C.
    Mateus, J.
    ICERI2014: 7TH INTERNATIONAL CONFERENCE OF EDUCATION, RESEARCH AND INNOVATION, 2014, : 6255 - 6263
  • [6] Blaze-Tasks: A Framework for Computing Parallel Reductions over Tasks
    Pirkelbauer, Peter
    Wilson, Amalee
    Peterson, Christina
    Dechev, Damian
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2019, 15 (04)
  • [7] Composing Parallel Software Efficiently with Lithe
    Pan, Heidi
    Hindman, Benjamin
    Asanovic, Krste
    ACM SIGPLAN NOTICES, 2010, 45 (06) : 376 - 387
  • [8] Composing Parallel Software Efficiently with Lithe
    Pan, Heidi
    Hindman, Benjamin
    Asanovic, Krste
    PLDI '10: PROCEEDINGS OF THE 2010 ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION, 2010, : 376 - 387
  • [9] Do Higher Incentives Lead to Better Performance? - An Exploratory Study on Software Crowdsourcing
    Wang, Lili
    Yang, Ye
    Wang, Yong
    2019 13TH ACM/IEEE INTERNATIONAL SYMPOSIUM ON EMPIRICAL SOFTWARE ENGINEERING AND MEASUREMENT (ESEM 2019), 2019, : 128 - 138
  • [10] Scheduling tasks in master-slave parallel processing systems
    Blazewicz, J
    Dell'Olmo, P
    Drozdowski, M
    MANAGEMENT AND CONTROL OF PRODUCTION AND LOGISTICS, VOL 1 AND 2, 1998, : 255 - 260