Kim, C. and H. Kameda (1990). An algorithm for optimal static load balancing in distributed computer systems. IEEE Trans. Comput. 41, 381--384. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Task Assignment and Transaction Clustering Heuristics for.. - Aguilar, Gelenbe (1997) (4 citations) (Correct)
....to balance computational load with communication requirements. In [Ta85] Tantawi and Towsley study a distributed system composed of a set of heterogeneous processors and develop a technique for static optimal probabilistic assignment. Other work on the static task assignment problem includes [Ki92, Ki88, Ky90]. There has also been substantial work on dynamic load balancing and process migration. For example [Li87, Li92, Ni85] propose algorithms which migrate tasks from overloaded to less loaded processors, while in [Li87] a gradient procedure for moving tasks is examined. In [Ni85] a drafting ....
C. Kim, H. Kameda, An algorithm for optimal static load balancing in distributed computer systems, IEEE Trans. on Computers, Vol. 41, pp. 381-384, 1992.
A Parallel Simulator for Task Allocation in a.. - Aguilar.. (1999) (Correct)
....of distributed systems, fault tolerance of distributed systems, parallel simulation. 1 Introduction In distributed and parallel systems the optimization of program execution times is an important issue, in particular, the task assignment problem has been widely studied in the literature [Ag94, Ag95, AG97, AH95, AH96, BS85, BK90, Bo87, Cy89, ERS90, HA94, HL86, JVV91, KK92, Lo88]. An optimal assignment of jobs tasks to different processors could speed up program execution times. The increasing need of reliable and dependable systems give the importance to the study of distributed and parallel systems where the processors are subject to breakdowns. Unreliable processors ....
Kim, C., Kameda, H. "An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems". IEEE Trans. on Computers, Vol. 41, No. 3 (March 1992).
Fairness in Non-convex Systems - Touati, Kameda, Inoie (2005) Self-citation (Kameda) (Correct)
No context found.
Kim, C. and H. Kameda (1990). An algorithm for optimal static load balancing in distributed computer systems. IEEE Trans. Comput. 41, 381--384.
Nash Equilibria In Load Balancing In Distributed Computer.. - Altman, Kameda, al. (2002) Self-citation (Kameda) (Correct)
No context found.
Kim, C. and H. Kameda (1990). "An Algorithm for optimal static load balancing in distributed computer systems," IEEE Trans. Compt., Vol. 41, No. 3, 381--384.
Paradoxes in Performance Optimization of Distributed.. - Kameda, Altman.. (2000) (1 citation) Self-citation (Kameda) (Correct)
No context found.
C. Kim and H. Kameda, "An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems," IEEE Trans. Comput. 41, 3, pp.381-384, 1990.
APerformance Comparison of Dynamic vs. Static Load.. - Hisao Kameda El-Zoghdy Self-citation (Kameda) (Correct)
....to what extent the optimal dynamic load balancing policy outperforms the static one by an exhaustive numerical investigation on a model for which both policies are analytically studied. Optimal static policies have been analytically studied in a variety of models for distributed computer systems [4, 5, 6, 7, 9]. On the other hand, as far as we know, optimal dynamic policies have been studied only in very specific models: one is that of using an M M m queueing model [2] and another is what we use here and is analytically studied in [1] That is, the model studied here consists of a Mainframe node and an ....
C. Kim and H. Kameda, An algorithm for optimal static load balancing in distributed computer systems, IEEE Trans. Computers., 41(3): 381-384, pp.381-384, 1990.
A Characterization of Paradoxes in Distributed Optimization .. - Kameda, Pourtallier (2000) Self-citation (Kameda) (Correct)
.... this work, it has been observed that increased capacity of a part of a system may lead to somewhat awkward behavior in terms of a system wide measure, in a model of distributed computer system [9, 10, 21] The methods and algorithms for obtaining the optima and the equilibria are described in 2 [10, 12, 13, 16, 20]. In this paper, we present an analytic study of a model of static load balancing among identical nodes each of which has an identical arrival. The results look quite counterintuitive and show that the ratio of the performance degradation in the paradoxical cases can be unlimitedly large. We ....
C. Kim and H. Kameda, "An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems," IEEE Trans. Compt. 41, 3, 1990, pp.381-384.
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