• ETRI Journal
• /
• v.28 no.4
• /
• pp.537-540
• /
• 2006

When multiple ZigBee wireless personal area networks (WPANs) are in close proximity to each other, contentions and collisions in transmissions will lead to increased packet delays. However, there is no existing study on how delay performance would be affected in a crowded real-life environment where each person walking down a busy street would be wearing a ZigBee WPAN. This letter studies the use of ZigBee WPANs in such a real-life environment for real-time heart beat monitoring. To be pragmatic, we derived a mobility pattern from the analysis of a real-life video trace. Then, we estimated the delay performance from the video trace by combining data collected from ZigBee experiments. The results show that the 300 ms packet delay requirement will not be met for only 11% of the time. When failure occurs, it will last for an average duration of 1.4 s.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.51-61
• /
• 2002

By using the arrival time approach of Chae et at. [6], we derive various performance measures including the queue length distributions (in PGFs) and the waiting time distributions (in LST and PGF) for both M$^{x}$ /G/1 and Geo$^{x}$ /G/1 queueing systems, both under the assumption that the server, when it becomes idle, takes multiple vacations up to a random maximum number. This is an extension of both Choudhury[7] and Zhang and Tian [11]. A few mistakes in Zhang and Tian are corrected and meaningful interpretations are supplemented.

• Journal of information and communication convergence engineering
• /
• v.17 no.4
• /
• pp.279-284
• /
• 2019

This paper presents processing-node status-based message scattering and gathering algorithms for multi-processor systems on chip to reduce the communication time between processors. In the message-scattering part of the message-passing interface (MPI) scatter function, data transmissions are ordered according to the proposed linear algorithm, based on the processor status. The MPI hardware unit in the root processing node checks whether each processing node's status is 'free' or 'busy' when an MPI scatter message is received. Then, it first transfers the data to a 'free' processing node, thereby reducing the scattering completion time. In the message-gathering part of the MPI gather function, the data transmissions are ordered according to the proposed linear algorithm, and the gathering is performed. The root node receives data from the processing node that wants to transfer first, and reduces the completion time during the gathering. The experimental results show that the performance of the proposed algorithm increases at a greater rate as the number of processing nodes increases.

• Journal of the Korean Home Economics Association
• /
• v.47 no.8
• /
• pp.13-24
• /
• 2009

This study investigated college students' time management behavior and time satisfaction according to the use of the time-matrix. Data were collected from 400 college students in Seoul by a self-administered questionnaire. Collected data were subjected to descriptive and comparative statistical analyses using the software SPSS(version 12.0). The conclusions of this study were as follows; 1. The use of time-matrix was categorized into 4 task groups: (1) not urgent but important, (2) urgent but notimportant, (3) neither urgent nor important, (4) urgent and important. 2. Time-management-behavior of planning was categorized into 3 components: standard setting, reality overlapping and implementing into 3 components(i.e., checking, adjusting, facilitating condition). 3. In all domains except overlapping, 'not urgent but importance' was the most popular managerial behavior. 4. However, 'neither urgent nor important' was voted the most popular in terms of managerial satisfaction. This study provides useful knowledge on managerial time-use categorization. Furthermore also contributes towards the knowledge base of time-managerial behaviors and dispels stereotypical-thinking that only bing busy all the time using is an indication of good time management behavior. Finally, this study advocates use of the time-matrix to achieve efficient time management.

• Industrial Engineering and Management Systems
• /
• v.15 no.2
• /
• pp.123-130
• /
• 2016

We introduce a queueing system with general arrival stream and exponential service time under the N-policy, where customers may renege during idle period and arrival rates may vary according to the server's status. Probability distributions of the lengths of idle period and busy period are derived using absorbing Markov chain approach and a method to obtain the optimal control policy that minimizes long-run expected operating cost per unit time is provided. Numerical analysis is done to illustrate and characterize the method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.4
• /
• pp.419-423
• /
• 2007

In this paper, we consider the M/G/1 queueing system with randomized control of T-policy. Whenever the busy period ends, the server is turned off and takes multiple vacations whose interval is fixed time T with probability p or stays on and waits for arriving customers with probability 1-p. We introduce the cost function and determine the optimal combination of (p, T) to minimize the average cost per unit time.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.69-74
• /
• 2003

There has been increasing of using Internet as time goes by, and it means that the analysis technique of appetence for the users logging into the internet system has been absolutely advanced. Keeping pace with the intense expansion of information, the mailing system is the one to be very busy on Internet service at the present time. This paper introduces to support users that carry handling account management easier by using virtual domain control on mail server. It also finds out the merit to get more efficient way to control the bunch of mails that classify into mail-box to users in advance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1599-1606
• /
• 1997

The software RAID file system is defined as the system which distributes data redundantly across an aray of disks attached to each workstations connected on a high-speed network. This provides high throughput as well as higher availability. In this paper, we present an efficient caching scheme for the software RAID filte system. The performance of this schmem is compared to two other schemes previously proposed for convnetional file systems and adapted for the software RAID file system. As in hardware RAID systems, small-writes to be the performance bottleneck in softwre RAID filte systems. To tackle this problem, we logically divide the cache into two levels. By keeping old data and parity val7ues in the second-level cache we were able to eliminate much of the extra disk reads and writes necessary for write-back of dirty blocks. Using track driven simulations we show that the proposed scheme improves performance for both the average response time and the average system busy time.

• International Journal of Reliability and Applications
• /
• v.11 no.2
• /
• pp.123-138
• /
• 2010

This paper investigates a mathematical model of a system composed of two non-identical unit parallel system with common-cause failure, critical human error, non-critical human error, preventive maintenance and two type of repair, i.e. cheaper and costlier. This system goes for preventive maintenance at random epochs. We assume that the failure, repair and maintenance times are independent random variables. The failure rates, repair rates and preventive maintenance rate are constant for each unit. The system is analyzed by using the graphical evaluation and review technique (GERT) to obtain various related measures and we study the effect of the preventive maintenance preventive maintenance on the system performance. Certain important results have been derived as special cases. The plots for the mean time to system failure and the steady-state availability A(${\infty}$) of the system are drawn for different parametric values.

• International Journal of Reliability and Applications
• /
• v.8 no.1
• /
• pp.67-82
• /
• 2007

This paper deals with the effectiveness analysis of an engineering system, which has two units of different strengths in parallel and one unit as a cold standby unit. Failure times for all the units have negative exponential distribution whereas their repair times have general distribution. Single server caters the need for the system. The effectiveness analysis of the system is done by using regenerative point technique. The different measures of effectiveness such as mean sojourn time, mean time to system failure, availability, busy period, etc, are derived. Cost factors also taken into consideration.