Dual Processor Scheduling with Dynamic Reassignment

Bokhari, Shahid H.

doi:10.1109/tse.1979.234201

Cited by 114 publications

(43 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This further reduces the problem's complexity by requiring us to consider a single replication factor r and a single scheduling constant f. Given a homogeneous system the quantity ~ qj is independent of the particular allocation j=~ (x~j) under consideration. This term will be constant in formulas (5) and (6) and so both (5) and (6) may be minimized by minimizing (1). We have assumed that the level of interprocessor communication will not be significantly affected by the choice of allocation in a SIFT-like system.…”

Section: Mathematical Formulation Of the Problemmentioning

confidence: 99%

Task allocation in fault-tolerant distributed systems

Bannister

Trivedi

1983

Acta Informatica

View full text Add to dashboard Cite

Summary. This paper examines task allocation in fault-tolerant distributed systems. The problem is formulated as a constrained sum of squares minimization problem. The computational complexity of this problem prompts us to consider an efficient approximation algorithm. We show that the ratio of the performance of the approximation algorithm to that of the optimal solution is bounded by 9m/(8(m-r+l)), where m is the number of processors to be allocated and r is the number of times each task is to be replicated. Experience with the algorithm suggests that even better performance ratios can be expected. List of Important Symbols

show abstract

Section: Mathematical Formulation Of the Problemmentioning

confidence: 99%

Task allocation in fault-tolerant distributed systems

Bannister

Trivedi

1983

Acta Informatica

View full text Add to dashboard Cite

show abstract

“…Many approaches have been reported for solving the Static tasks assignment problem in a DRTS [1][2][3][4][5][6][7]. While in dynamic allocation a module can be reassigned during program execution [8][9][10][11]. Donight et al [12] has determined the level of reliability of components with expending low cost.…”

Section: Introductionmentioning

confidence: 99%

A Heuristic Model for Tasks Scheduling in Heterogeneous Distributed Real Time System under Fuzzy Environment

Kumar¹

2015

IJCA

View full text Add to dashboard Cite

The development of distributed real time system (DRTS) has lead to there use in several applications including information processing, fluid flow, weather modeling, database systems, real-time high-speed simulation of dynamical systems, and image processing. Reliability analysis of these processing elements and communication links is one of the important parameter to get the system efficiency. We can improve the system performance (i.e. system cost, system reliability and processor utilization etc.) by scheduling the tasks to the processors properly in DRTS. In this paper, a new tasks allocation model has been developed with fuzzy execution times , and fuzzy inter tasks communication times , .The times has been defuzzified into crisp one by using Robust Ranking Method [RRM], Centre of Maxima Method [CoM] and Weight of Center of Area Method [CoA].The effect of inter processor distances on the tasks allocation has been considered while developing the model. Numerical examples show that the model presented in this paper is suitable for arbitrary number of processors with random program structure and more realistic and general in nature.

show abstract

“…Tripathi et al [8][9] developed a genetic approach for allocating the tasks to the processors. Bokhari [10] analyzed the problem of dynamic assignment in a two-processor system which permits relocation of tasks from one processor to other at certain points during the execution of the program. Such relocation incurs a predefined relocation cost that contributes to the total cost of running the program and code-conversion overheads.…”

Section: Introductionmentioning

confidence: 99%

A Tasks Allocation Model with Fuzzy Execution and Fuzzy Inter-Tasks Communication Times in a Distributed Computing System

Kumar¹,

Singh²,

Yadav³

2013

IJCA

View full text Add to dashboard Cite

Distributed computing system [DCS] offer the potential for improved performance and resource sharing. To make the best use of the computational power available it is essential to assign the tasks to that processor whose characteristics are most appropriate for the execution. In this paper we have investigated a tasks allocation problem with fuzzy execution times , and fuzzy inter tasks communication times , which is more realistic and general in nature. Times , and , have been considered to be triangular and trapezoidal numbers. The fuzzy tasks allocation problem is defuzzified and converted into crisp ones using fuzzy number ranking method. A mathematical model has been developed to determine the optimal allocation of the tasks for the crisp problem that minimizes the total cost of the program. The allocation plan that minimizes the total cost for the new crisp problem also minimizes the total time for the original fuzzy tasks allocation. Numerical examples show that the model presented in this paper offers an effective tool for handling the fuzzy tasks allocation problem

show abstract

Dual Processor Scheduling with Dynamic Reassignment

Cited by 114 publications

References 5 publications

Task allocation in fault-tolerant distributed systems

Task allocation in fault-tolerant distributed systems

A Heuristic Model for Tasks Scheduling in Heterogeneous Distributed Real Time System under Fuzzy Environment

A Tasks Allocation Model with Fuzzy Execution and Fuzzy Inter-Tasks Communication Times in a Distributed Computing System

Contact Info

Product

Resources

About