Partitioning and allocation of objects in heterogeneous distributed environments using the niched pareto genetic-algorithm

被引:5
作者
Choi, S [1 ]
Wu, C [1 ]
机构
[1] Seoul Natl Univ, Dept Comp Sci, Seoul, South Korea
来源
1998 ASIA PACIFIC SOFTWARE ENGINEERING CONFERENCE, PROCEEDINGS | 1998年
关键词
D O I
10.1109/APSEC.1998.733736
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
As the importance of middleware-based distributed object computing environments (e.g. CORBA and DCOM) increases, there is considerable interest in incorporation of object-orientation (OO) and distributed systems. One important aspect of distributed object systems is effective distribution of software components, to achieve some performance goals, such as balancing the workloads, maximizing the degree of concurrency and minimizing the entire communication costs. Although there have been a lot of works on partitioning and allocation for distributed system, they are not directly applicable to OO system. We developed a partitioning and allocation model for mapping OO applications to heterogeneous distributed environments, and evaluated it using genetic algorithm (GA). Our model applies the graph-theoretic approach, dealing with a lot of characteristics of OO paradigm. The Niched Pareto GA [7] is adopted to experiment our model because a partitioning and allocation problem is multiobjective problem with non-commensurable objectives.
引用
收藏
页码:322 / 329
页数:8
相关论文
共 13 条
[1]  
AGUILAR J, P 3 INT ACPC C SPEC, P174
[2]  
[Anonymous], 1993, 93005 IIIIGAL U ILL
[3]  
Bellur U., 1994, P 27 HAW INT C SYST
[4]  
Chang W., 1995, J OBJECT ORIENTED PR, V8
[5]  
Chang W., 1995, J OBJECT ORIENTED PR, V7
[6]  
FONSECA C, 1993, P 5 INT C GEN ALG JU
[7]  
Goldberg D., 1989, GENETIC ALGORITHMS S
[8]  
HOUSTIS C, 1990, IEEE T SOFTWARE ENG, V16
[9]  
KRISHNAN S, 1996, P 10 ACM INT C SUP M
[10]   Load balanced mapping of distributed objects to minimize network communication [J].
Stoyenko, AD ;
Bosch, J ;
Aksit, M ;
Marlowe, TJ .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 34 (02) :117-136