R.K. Arora and S.P. Rana. "Heuristic algorithms for process assignment in distributed computing system", Information Processing Letters, 11(4,5):199-203, 1980. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Framework For Automated Performance Engineering of Distributed .. - El-Sayed (1999) (2 citations) (Correct)
....consideration the allocation constraints. Every generated solution was checked first to see whether the allocation constraints are satisfied. If yes, the cost of the solution was evaluated; otherwise, the solution was discarded and future expansion from the solution was eliminated. Arora and Rana [Arora80] considered a heuristic approach to solve the general process assignment problem. The solution was based on the repetitive reassignment of processes, one process at a time. The algorithm terminates when it is not possible to do any further improvement over the current solution. Chu and Lan ....
R.K. Arora and S.P. Rana. "Heuristic algorithms for process assignment in distributed computing system", Information Processing Letters, 11(4,5):199-203, 1980.
Design Issues of Process Migration Facilities in Distributed.. - Eskicioglu (1990) (17 citations) (Correct)
....be more costly than with the previous approach. 3. 3 Load Distribution Policies Load distribution for improving the overall performance of a distributed computing system has been extensively discussed in the literature, and many theoretical models and algorithms have been proposed (for example, [34, 35, 36, 37, 38, 39, 40], to list a few) It has been shown that performance improvements can be achieved by relocating processes in a distributed computing system [5, 7, 8] Several distributed systems adopt these models as their design goals for process migration [28, 38] Irrespective of its model, a load distribution ....
R. K. Arora and S. P. Rana. Heuristic Algorithms for Process Assignment in Distributed Computing Systems. Information Processing Letters, 11(4--5):199--203, December 1980.
A New Mapping Heuristic Based On Mean Field Annealing - Tevfik Bultan (1992) (8 citations) (Correct)
....way that the total execution time is minimized. The second step, named as the mapping problem [4] is very crucial in designing efficient parallel programs. In general, the mapping problem is known to be NP hard [12, 13] Hence, heuristics giving sub optimal solutions are used to solve the problem [1, 4, 7, 12, 13, 21]. Two distinct approaches have been considered in the context of mapping heuristics; one phase and two phase [7] In one phase approaches, referred as many to one mapping, tasks of the parallel program are directly mapped onto the processors of the multicomputer. In two phase approaches, ....
Arora, R. K., and Rana, S. P., Heuristic algorithms for process assignment in distributed computing systems. Information Processing Letters, vol. 11, no. 4-5, pp. 199-203, 1980.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC