• Journal of the Korean Data and Information Science Society
• /
• v.6 no.2
• /
• pp.1-7
• /
• 1995

This paper considers the reliability estimation of a two-component shared-load system based on Freund model. Maximum likelihood estimator, order restricted maximum likelihood estimator and uniformly minimum variance unbiased estimator of the reliability function for the system are obtained. Performance of three estimators for moderate sample sizes is studied by simulation.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.3
• /
• pp.467-474
• /
• 2009

There are many situations arising in reliability engineering and biomedical science where failure of a subsystem increases the failure rate of other subsystem under shared load models. In this paper, the maximum likelihood estimates and the modified maximum likelihood estimates of mean time to failure and reliability function for shared load model with guarantee time are obtained by using censored system life data. Some illustrative examples are included.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2137-2142
• /
• 2003

One of the important performance metrics of the World Wide Web is how fast and precise a request from users will be serviced successfully. Shared Web Caching (SWC) is one of the techniques to improve the performance of the network system. In Shared Web Caching Systems, the key issue is on deciding when and where an item is cached, and also how to transfer the correct and reliable information to the users quickly. Such SWC distributes the items to the proxies which have sufficient capacity such as the processing time and the cache sizes. In this study, the Hot Spot Prediction Algorithm (HSPA) has been suggested to improve the consistent hashing algorithm in the point of the load balancing, hit rate with a shorter response time. This method predicts the popular hot spots using a prediction model. The hot spots have been patched to the proper proxies according to the load-balancing algorithm. Also a simulator is developed to utilize the suggested algorithm using PERL language. The computer simulation result proves the performance of the suggested algorithm. The suggested algorithm is tested using the consistent hashing in the point of the load balancing and the hit rate.

• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.489-498
• /
• 2013

In this paper, we propose a common simulation model that can be reused for different performance evaluations of networked virtual environments. To this end, we analyzed the common features of NVEs, in which multiple regions compose a shared space, and where a user has his/her own interest area. Communication architecture can be client-server or peer-server models. In usual simulations, users move around the world while the number of users varies with the system. Our model provides various simulation parameters to customize the region configuration and user movement pattern. Furthermore, our model introduces a way to mimic a lot of users in a minimal experiment environment. The proposed model is integrated with our network framework, which supports various scalability approaches. We specifically applied our model to the interest management and load distribution schemes to evaluate communication overhead. With the proposed simulation model, a new simulation can be easily designed in a large-scale environment.

• Journal of the Korean Society of Safety
• /
• v.14 no.2
• /
• pp.155-162
• /
• 1999

reliability from components reliability. In this case, it assumes that components failure is mutually independent, but it may not true in real systems. In this study, the mean cost per unit time is computed as the ratio of mean life to the mean cost. The mean life is obtained by the reliability function under power rule model. The mean cost is obtained by the mathematical model based on the inspection interval. A heuristic method is proposed to determine the optimal number of redundant units and the optimal inspection interval to minimize the mean cost per unit time. The assumptions of this study are as following : First, in the load-sharing k-out-of-n:G system, total loads are applied to the system and shared by the operating components. Secondly, the number of failed components affects the failure rate of surviving components as a function of the total load applied. Finally, the relation between the load and the failure rate of surviving components is set by the power rule model. For the practical application of the above methods, numerical examples are presented.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.4
• /
• pp.921-929
• /
• 2014

A bivariate exponential distribution with a location parameter is proposed as a model for a two-component shared load system with a guarantee time. Some statistical properties of the proposed model are investigated. The maximum likelihood estimators and uniformly minimum variance unbiased estimators of the parameters, mean time to failure, and the reliability function of system are obtained with unknown guarantee time. Simulation studies are given to illustrate the results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.817-824
• /
• 1997

This paper is concerned with a parallel system that sustains a time-independent load and consists of n components with exponential lifetimes. It is assumed that the total load is shared by the functioning components and the failures of components induce higher failure rates in the surviving components according to the relationship between the load and the failure rates. The power rule model among several load-failure rate relationships is considered. Firstly, the reliability function is obtained. Secondly, the optimization problem in this load-sharing parallel system is considered. The optimal redundant units and inspection interval are obtained. Some numerical examples are studied.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.180-192
• /
• 2002

We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new harsh join methods in the shared-nothing multiprocessor environment. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets dynamically via a frequency distribution. Using harsh-based joins, multiple joins can be pipelined to that the early results from a join, before the whole join is completed, are sent to the next join processing without staying in disks. Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. However, this hardware structure is very sensitive to the data skew. Unless the pipelining execution of multiple hash joins includes some dynamic load balancing mechanism, the skew effect can severely deteriorate the system performance. In this parer, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.1
• /
• pp.97-107
• /
• 1998

This paper is concerned with a parallel system that sustains a time-independent load and consists of n components with exponential lifetimes. It is assumed that the total load is shared by the working components and the failures of components increase higher failure rates in the surviving components according to the relationship between the load and the fialure rates. The power rule model among several load-failure rate relationships is considered. We consider the system efficiency meausre as the expected profit earned by the system per unit time. The high load causes high gain but it also occurs frequent system failures. The expected profit per unit time is used as criterion to evaluate the system efficiency. The goal of system engineer is to determine the optimal load and redundant units maximizing the expected profit per unit time. First, the system reliability function is obtained and the optimization problem of the load-sharing parallel system is considered. Given the redundant units, the existence of the optimal load can be proved analytically and given the load, the optimal redundant units can be solved also analytically. The optimal load and redundant units are obtained simultaneously by numerical computation. Some numerical examples are studied.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.635-642
• /
• 2003

The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.