A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System

Bokhari, Shahid H.

doi:10.1109/tse.1981.226469

Cited by 178 publications

(78 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Here, the problem lies in assigning a set of interrelated computing tasks to processors with respect to both computation time and communication, which is again very similar to the problem of GSD. Bokhari [39] developed an algorithm that assigns software modules to nodes with the objective of minimizing the weighted sum of communication and execution costs. For dynamic job assignment, Amir et al [40] developed a distribution model that, based on the expected resource usage of incoming jobs, assigns jobs with the objective of minimizing the overall slowdown.…”

Section: Description Of the Approachesmentioning

confidence: 99%

See 1 more Smart Citation

A multi-criteria distribution model for global software development projects

Lamersdorf

Münch

2010

J Braz Comput Soc

View full text Add to dashboard Cite

The allocation of development tasks to sites is one of the most important activities in the management of global software development projects. Its various influences on the risks and benefits of distributed projects require careful consideration of multiple allocation criteria in a systematic way. In practice, however, work is often allocated based on only one single criterion such as cost, and defined processes or algorithms for task allocation are typically not used.Existing research approaches mainly focus on selected aspects such as the minimization of crosssite communication and are difficult to adapt to specific environments. This article presents a customizable multi-criteria model for task allocation in global software development projects.Based on an analysis of the state of the practice, a set of requirements was derived and used for evaluating existing task allocation models from different domains. The Bokhari algorithm was identified as a suitable starting point and modified with respect to the fulfillment of the requirements. The modification includes the development of mechanisms for customization, the incorporation of cause-effect relationships, and the use of probabilistic modeling of uncertainty with Bayesian networks. The application of the model is demonstrated in different scenarios that represent typical hypothetical and real distribution decision problems in industrial contexts.Experience from applying the model to such problems has shown, for instance, that depending on the weight of different criteria, very different task distributions will result. This demonstrates, in consequence, the need for systematic multi-criteria task allocation support in global software development.

show abstract

Section: Description Of the Approachesmentioning

confidence: 99%

“…In the model of Bokhari [39], tasks are described as modules that communicate with each other and can be assigned to different processors. It is assumed that communication between the modules follows a tree structure, the so-called invocation tree.…”

Section: The Task Distribution Model By Bokharimentioning

confidence: 99%

A multi-criteria distribution model for global software development projects

Lamersdorf

Münch

2010

J Braz Comput Soc

View full text Add to dashboard Cite

show abstract

“…If we now move to consider process interaction in a multiprocessor system then the complexity of scheduling is further increased 4,27,46,81 (i.e. NP-hard).…”

Section: Remote Blockingmentioning

confidence: 99%

Real-Time System Scheduling

Audsley

Burns

Davis

et al. 1995

Predictably Dependable Computing Systems

View full text Add to dashboard Cite

Recent results in the application of scheduling theory to dependable real-time systems are reviewed. The review takes the form of an analysis of the problems presented by different application requirements and characteristics. Issues covered include uniprocessor and multiprocessor systems, periodic and aperiodic processes, static and dynamic algorithms, transient overloads and resource usage. Protocols that bound and reduce blocking are discussed. A review of specific real-time kernels is also included.

show abstract

“…Efficient algorithms that give the optimal schedule can only be obtained when some restrictions are imposed on the models representing the application and the multiprocessor or distributed system. There are only few known deterministic polynomial-time scheduling algorithms [10,17,18]; therefore, solving the general scheduling problem in polynomial-time requires the use of heuristic algorithms that provide near-optimal solutions.…”

Section: Introductionmentioning

confidence: 99%