• Communications for Statistical Applications and Methods
• /
• v.17 no.6
• /
• pp.891-898
• /
• 2010

In real software development fields, software is unified by several modules that are developed before the software testing period. For the evaluation of software task processing performance, this paper considers the software imperfect debugging model that is proposed by Lee and Park (2003) and presents the measures of a unified software, such as the completion probability of a task which is completed in a time interval and the expected number of the completed tasks. In addition, we suggest a software release policy that satisfies the required level of the expected perfect debugging, completion probability, and availability.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.2
• /
• pp.61-69
• /
• 2022

A multi-agent system is a system that aims at achieving the best-coordinated decision based on each agent's local decision. In this paper, we consider a multi agent-multi task assignment problem. Each agent is assigned to only one task and there is a completion probability for performing. The objective is to determine an assignment that maximizes the sum of the completion probabilities for all tasks. The problem, expressed as a non-linear objective function and combinatorial optimization, is NP-hard. It is necessary to design an effective and efficient solution methodology. This paper presents an approximation algorithm using submodularity, which means a marginal gain diminishing, and demonstrates the scalability and robustness of the algorithm in theoretical and experimental ways.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2007.11a
• /
• pp.327-330
• /
• 2007

This paper verifies that the normality assumption that the simulation output data, Project Completion Times (PCTs), follow normal distribution is not always acceptable and the existing belief may lead to misleading results. A risk quantification method, which measures the effect caused by the assumption, relative to the probability distribution of PCTs is implemented as an algorithm in MATLAB. To validate the reliability of the quantification, several series of simulation experiments have been carried out to analyze a set of simulation output data which are obtained from different type of Probability Distribution Function (PDF) assigned to activities'duration in a network. The method facilitates to find the effect of PDF type and its parameters. The procedure necessary for performing the risk quantification method is described in detail along with the findings. This paper contributes to improving the reliability of simulation based scheduling method, as well as increasing the accuracy of analysis results.

• Management Science and Financial Engineering
• /
• v.15 no.2
• /
• pp.1-21
• /
• 2009

We consider an $M^x/G/1$ queueing system with a random setup time under Bernoulli vacation schedule, where the service of the first unit at the completion of each busy period or a vacation period is preceded by a random setup time, on completion of which service starts. However, after each service completion, the server may take a vacation with probability p or remain in the system to provide next service, if any, with probability (1-p). This generalizes both the $M^x/G/1$ queueing system with a random setup time as well as the Bernoulli vacation model. We carryout an extensive analysis for the queue size distributions at various epochs. Further, attempts have been made to unify the results of related batch arrival vacation models.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.9
• /
• pp.5652-5659
• /
• 2014

The purpose of this study was to introduce a software task processing evaluation model that considers the following situations: i) a software system is integratedly composed of several number of modules, ii) each modules has its corresponding module task, iii) all module tasks are tested simultaneously, and iv) the processing times of the module tasks are mutually dependent. The software task completion probability with the module dependency was derived using the joint distribution function of Farlie [11]. The results showed that the task completion probability of software increases with increasing module dependency parameter.

• Journal of Korea Society of Industrial Information Systems
• /
• v.28 no.1
• /
• pp.27-34
• /
• 2023

The optimal assignment problem between agents and tasks is known as one of the representative problems of combinatorial optimization and an NP-hard problem. This paper covers multi agent-multi task assignment problems with uncertain completion probability. The completion probabilities are generally uncertain due to endogenous (agent or task) or exogenous factors in the system. Assignment decisions without considering uncertainty can be ineffective in a real situation that has volatility. To consider uncertain completion probability mathematically, a mathematical formulation with stochastic programming is illustrated. We also present an algorithm by using the sample average approximation method to solve the problem efficiently. The algorithm can obtain an assignment decision and the upper and lower bounds of the assignment problem. Through numerical experiments, we present the optimality gap and the variance of the gap to confirm the performances of the results. This shows the excellence and robustness of the assignment decisions obtained by the algorithm in the problem with uncertainty.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.9
• /
• pp.29-36
• /
• 2010

Consider an RFID network configured as a star such that a single reader is surrounded by a crowd of tags. In the RFID network, prior to attaining the information stored at a tag, the reader must cognize the tags while arbitrating a collision among tags' responses. For this purpose, we present a tag cognizance scheme based on framed and slotted ALOHA, which statically provides a number of slots in each frame for the tags to respond. For the evaluation of the cognizance performance, we choose the cognizance completion probability and the expected cognizance completion time as key performance measures. Then, we present a method to numerically calculate the performance measures. Especially, for small numbers of tags, we derive them in a closed form. Next, we formulate a problem to find an optimal time structure which either maximizes the cognizance completion probability under a constraint on the cognizance time or minimizes the expected cognizance completion time. By solving the problem, we finally obtain an optimal number of slots per frame for the tags to respond. From numerical results, we confirm that there exist a finite optimal number of slots for the tags to respond. Also, we observe that the optimal number of slots maximizing the cognizance completion probability tends to approach to the optimal number of slots minimizing the expected cognizance completion time as the constraint on the cognizance time becomes loose.

• Communications for Statistical Applications and Methods
• /
• v.19 no.4
• /
• pp.571-577
• /
• 2012

Modules that consist of software are respectively coded in the early development phase and the modules are unified as a software. After unification, the software is repeatedly tested with a given taskset (the set of module tasks that are tested simultaneously) until a required performance level is satisfied. In this paper, we expand the one-module software debugging model of Jang and Lee (2011) to a multi-module debugging model and derive the taskset completion probability and the mean of the completed tasksets under the assumption that the processing times of module tasks given in a taskset are mutually dependent.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.4
• /
• pp.376-380
• /
• 2008

This paper deals with a performance analysis of real-time control systems, which engages DMR(dual modular redundancy) to detect transient errors and checkpointing technique to tolerate transient errors. Transient errors are caused by transient faults and the most significant type of errors in reliable computer systems. Transient faults are assumed to occur according to a Poisson process and to be detected by a dual modular redundant structure. In addition, an equidistant checkpointing strategy is considered. The probability of the successful task completion in a real-time control system where periodic checkpointing operations are performed during the execution of a real-time control task is derived. Numerical examples show how checkpoiniting scheme influences the probability of task completion. In addition, the result of the analysis is compared with the simulation result.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.1
• /
• pp.148-154
• /
• 2012

For a successful checkpointing strategy, we should place checkpoints so as to optimize fault-tolerance capability of real-time systems. This paper presents a novel scheme of checkpoint placement for real-time systems with periodic multi-tasks. Under the influence of transient faults, multi-tasks are scheduled by the Rate Monotonic (RM) algorithm. The optimal checkpoint intervals are derived to maximize the probability of task completion. In particular, this paper is concerned about the general case that the deadline of a task is longer than the period. Compared with the special condition that the deadline is equal to or less than the period, this general case causes a more complicate test procedure for schedulability of the RM algorithm with respect to a given set of checkpoint re-execution vectors. The probability of task completion is also derived in a more complex form. A case study is given to show the applicability of the proposed scheme.