Assigning Tasks in a 24-Hour Software Development Model

Jalote, Pankaj; Jain, G.

doi:10.1109/apsec.2004.33

Cited by 17 publications

(17 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, Jalote and Jain [23] presented a scheduling algorithm that considers task dependencies, available skills, and resource constraints but their approach expects a task graph as an input. Our approach complements their approach in that we can use the DRH as an input task graph to their algorithm.…”

Section: Related Workmentioning

confidence: 99%

Design Rule Hierarchies and Parallelism in Software Development Tasks

Wong

Cai

Valetto

et al. 2009

2009 IEEE/ACM International Conference on Automated Software Engineering

View full text Add to dashboard Cite

As software projects continue to grow in scale, being able to maximize the work that developers can carry out in parallel as a set of concurrent development tasks, without incurring excessive coordination overhead, becomes increasingly important. Prevailing design models, however, are not explicitly conceived to suggest how development tasks on the software modules they describe can be effectively parallelized. In this paper, we present a design rule hierarchy based on the assumption relations among design decisions. Software modules located within the same layer of the hierarchy suggest independent, hence parallelizable, tasks. Dependencies between layers or within a module suggest the need for coordination during concurrent work. We evaluate our approach by investigating the source code and mailing list of Apache Ant. We observe that technical communication between developers working on different modules within the same hierarchy layer, as predicted, is significantly less than communication between developers working across layers.

show abstract

Section: Related Workmentioning

confidence: 99%

Design Rule Hierarchies and Parallelism in Software Development Tasks

Wong

Cai

Valetto

et al. 2009

2009 IEEE/ACM International Conference on Automated Software Engineering

View full text Add to dashboard Cite

show abstract

“…In theory, we can see factors that could affect these variables in positive ways (for example round-the-clock development [14]), in negative ways (for example lack of face-to-face communication [16,10]), and in ways that are indeterminate (think of cultural diversity [19]). I therefore tried to extract from the data at hand measures that could be used to examine correlation between metrics of global software development, and productivity or software quality.…”

Section: Productivity and Qualitymentioning

confidence: 99%

Global software development in the freeBSD project

Spinellis

2006

Proceedings of the 2006 International Workshop on Global Software Development for the Practitioner

View full text Add to dashboard Cite

Freebsd is a sophisticated operating system developed and maintained as open-source software by a team of more than 350 individuals located throughout the world. This study uses developer location data, the configuration management repository, and records from the issue database to examine the extent of global development and its effect on productivity, quality, and developer cooperation. The key findings are that global development allows round-the-clock work, but there are some marked differences between the type of work performed at different regions. The effects of multiple dispersed developers on the quality of code and productivity are negligible. Mentoring appears to be sometimes associated with developers living closer together, but ad-hoc cooperation seems to work fine across continents.

show abstract

“…Distributed Software Development: Many software companies have campuses across the globe and teams collaborate across both distances and time zones [3,5]. While interdependent tasks within a project must be scheduled for their timely completion, a team liaison must videoconference -often after normal workhours -with the team to which the code is being sent to facilitate the handoff.…”

Section: Motivating Domainsmentioning

confidence: 99%

Multiply-constrained distributed constraint optimization

Bowring

Tambe

Yokoo

2006

Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems

View full text Add to dashboard Cite

Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, in many domains, agents must satisfy additional constraints on resources consumed locally (due to interactions within their local neighborhoods). Such resource constraints may be required to be private or shared for efficiency's sake. This paper provides a novel multiply-constrained DCOP algorithm for addressing these domains which is based on mutually-intervening search, i.e. using local resource constraints to intervene in the search for the optimal solution and vice versa. It is realized through three key ideas: (i) transforming n-ary constraints to maintain privacy; (ii) dynamically setting upper bounds on joint resource consumption with neighbors; and (iii) identifying if the local DCOP graph structure allows agents to compute exact resource bounds for additional efficiency. These ideas are implemented by modifying Adopt, one of the most efficient DCOP algorithms. Both detailed experimental results as well as proofs of correctness are presented.

show abstract

Assigning Tasks in a 24-Hour Software Development Model

Abstract: Abstract

Cited by 17 publications

References 12 publications

Design Rule Hierarchies and Parallelism in Software Development Tasks

Design Rule Hierarchies and Parallelism in Software Development Tasks

Global software development in the freeBSD project

Multiply-constrained distributed constraint optimization

Contact Info

Product

Resources

About