• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.5
• /
• pp.3-11
• /
• 2005

This paper presents a performance analysis model based on an M/M/1 queue and Poisson distribution of input data traffic. The simulation on a pipelined AES system with processing rate of 10 rounds per clock shows $4.0\%$ higher performance than a non-pipelined version consuming 10 clocks per transaction. Physical implementation of pipelined AES with FPGA takes 3.5 times bigger gate counts than the non-pipelined version whereas the pipelined version yields only $3.5\%$ performance enhancement. The proposed analysis model can be used to optimize cost-performance of AES hardware designs.

• PNF and Movement
• /
• v.19 no.2
• /
• pp.269-278
• /
• 2021

Purpose: This study aimed to investigate effective cueing methods for selective muscle activation of the serratus anterior. Methods: Based on the inclusion criteria, 26 healthy adults, both males and females, were recruited for the measurement of muscle activation of the upper trapezius and serratus anterior muscles while performing basic movements in knee push-up plus (KPP) and dynamic hug (DH) positions using five different cueing methods. An electromyogram was used to measure muscle activation, and both muscle activation and muscle ratio (serratus anterior/upper trapezius) were compared during the basic movements and different cueing methods. The cueing methods were trapezius verbal cueing, trapezius verbal cueing + trapezius tactile cueing, emphasis verbal cueing, serratus anterior tactile cueing, and trapezius verbal cueing + trapezius tactile cueing + serratus anterior tactile cueing. Results: The results of the study showed that there was a significant difference in the muscles for the two exercises (p < 0.05). There was also a significant difference between the cueing methods (p < 0.05). The correlative effect between the muscles and cueing methods was also significant (p < 0.05). The muscle ratio in trapezius verbal cueing + trapezius tactile cueing + serratus anterior tactile cueing during KPP and DH was higher than in basic movements and other cueing methods. This confirms that trapezius verbal cueing + trapezius tactile cueing + serratus anterior tactile cueing is an effective cueing method for selective activation of the serratus anterior during KPP and DH. This study also demonstrated that cueing by a therapist may both increase and decrease selective muscle activation. Conclusion: Through this study, an effective cueing method to selectively activate the serratus anterior may be suggested, and the results of this study may provide basic information regarding future studies and clinical practice.

• Journal of Internet Computing and Services
• /
• v.23 no.5
• /
• pp.33-46
• /
• 2022

This paper, in order to minimize the ground waiting time of an Air tanker, the queuing theory, that is, a queue that calculates the waiting time under single-server and multi-server situations, was used in the study. Since the national budget and resources are limited, the unlimited increase of the logistics support service team is limited. Therefore, the number of logistic support service teams that can adaptively control the ground waiting time according to the wartime preparation stage or war environment was calculated. The results of this study provide a stipulated standard for calculating the optimal number of air tanker logistic support service teams of the Air Force, providing a basis for the logistical commander to assign logistic support service teams to each stage from peacetime to wartime.

• Journal of Internet of Things and Convergence
• /
• v.9 no.3
• /
• pp.1-6
• /
• 2023

One of the economical ways to satisfy the quality of service desired by the user in a web service environment is to adjust the size of the object. To this end, this study finds the maximum size of objects that satisfy this constraint when the mean response time is given below an arbitrary threshold for quality of service. It can be inferred that in the steady state of system, the mean response time in the deterministic model by using the round-robin will be the same as that of the queueing model following the general distribution. Based on this, analytical formulas and procedures for finding the maximum object size are obtained. As a service distribution of web traffic, the Pareto distribution is appropriate, so the maximum object size is computed by applying the M/G(Pareto)/1 model and the M/G/1/PS model using exponential distribution as computational experience. Performance evaluation through numerical calculation shows that as the shape parameter in the Pareto distribution increases, the M/G(Pareto)/1 model and M/G/1/PS model have the same maximum object size. The results of this study can be used to environments where objects can be sized for economical web service control.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.61-67
• /
• 2023

The rise of 5G and the proliferation of smart devices have underscored the significance of multi-access edge computing (MEC). Amidst this trend, interest in effectively processing computation-intensive and latency-sensitive applications has increased. This study investigated a novel task offloading strategy considering the probabilistic MEC environment to address these challenges. Initially, we considered the frequency of dynamic task requests and the unstable conditions of wireless channels to propose a method for minimizing vehicle power consumption and latency. Subsequently, our research delved into a deep reinforcement learning (DRL) based offloading technique, offering a way to achieve equilibrium between local computation and offloading transmission power. We analyzed the power consumption and queuing latency of vehicles using the deep deterministic policy gradient (DDPG) and deep Q-network (DQN) techniques. Finally, we derived and validated the optimal performance enhancement strategy in a vehicle based MEC environment.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.367-379
• /
• 1994

This paper describes scheduling algorithms of the UNIX operating system and shows an analytical approach to approximate the average conditional response time for a process in the UNIX operating system. The average conditional response time is the average time between the submittal of a process requiring a certain amount of the CPU time and the completion of the process. The process scheduling algorithms in thr UNIX system are based on the priority service disciplines. That is, the behavior of a process is governed by the UNIX process schuduling algorithms that (ⅰ) the time-shared computer usage is obtained by allotting each request a quantum until it completes its required CPU time, (ⅱ) the nonpreemptive switching in system mode and the preemptive switching in user mode are applied to determine the quantum, (ⅲ) the first-come-first-serve discipline is applied within the same priority level, and (ⅳ) after completing an allotted quantum the process is placed at the end of either the runnable queue corresponding to its priority or the disk queue where it sleeps. These process scheduling algorithms create the round-robin effect in user mode. Using the round-robin effect and the preemptive switching, we approximate a process delay in user mode. Using the nonpreemptive switching, we approximate a process delay in system mode. We also consider a process delay due to the disk input and output operations. The average conditional response time is then obtained by approximating the total process delay. The results show an excellent response time for the processes requiring system time at the expense of the processes requiring user time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.942-955
• /
• 2000

This paper proposes enhanced designs of global service logic and information flow for the mass-call based IN service, which increase call completion rates and optimize the resource in joint wired and wireless networks. In order to hanve this logic implemented, we design a Dynamic Queue Manager(DQM) applied to the call queuing service feature in the Service Control Point(SCP). In order to apply this logic to wireless service subscribers as well as wired service subscribers, the service registration flags between the Home Location Register(HLR) and the SCP are managed to notify the DQM of the corresponding service subscribers’ mobility. Hence, we present a dynamic queue management mechanism, which dynamically manages the service group and the queue size based on M/M/c/K queueing model as the wireless subscribers roam the service groups due to their mobility characteristics. In order to determine the queue size allocated by the DQM, we simulator and analyze the relationship between the number of the subscriber’s terminals and the drop rate by considering the service increment rate. The appropriate waiting time in the queue as required is simulated according to the above relationship. Moreover, we design and implement the DQM that includes internal service logic interacting with SIBs(Service Independent building Blocks) and its data structure.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.4
• /
• pp.421-429
• /
• 2000

In present, ATM integrated switching system has been developed to a mixed modules that complexed switching system including maintenance, operation based on B-ISDN/LAN service and plug-in module, , which runs on workstation computer system. Meanwhile, workstation has HMI operation system feature including file system management, time management, graphic processing, TMN agent function. The workstation has communicated with between ATM switching module and clients. This computer system architecture has much burden messages communication among processes or processor. These messages communication consume system resources which are socket, message queue, IO device files, regular files, and so on. Therefore, in this paper we proposed new performance modeling with this system architecture. We will analyze the system bottleneck and improve system performance. In addition, in the future, the system has many additional features should be migrated to workstation system, we need previously to evaluate system bottleneck and redesign it. In performance model, we use queueing network model and the simulation package is used PDQ and C-program.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.4
• /
• pp.171-180
• /
• 2004

CDP(handoff Call Dropping Probability) and CBP(new Call Blocking Probability) have been used as two important call level QoS parameters in cellular mobile communications. But, many methods to reduce CDP without considering CBP have been studied, and hand-off call priority scheme has been introduced. But the use of hand-off call priority scheme increases CBP and decreases channel utilization rate depending on the number of reserved channel for priority. In this paper, we propose a CAC(Call Admission Control) algorithm with overflow and preemption to solve the problem caused by considering CDP and CBP in calculation of the number of channel reserved. The problem is the increase of CDP as the traffic load increases. In our CAC algorithm, hand-off call is permitted to use(overflow) unreserved and unused channel if there is no reserved and unused channel, and new call is permitted to use(preemption) the channel overflowed by hand-off call if there is no unreserved and unused channel. This mechanism of calculation of the number of reserved channel and CAC algorithm is expected to increase channel utilization rate, and can be applied to media-based QoS provision in cellular mobile communications.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.2
• /
• pp.134-141
• /
• 2008

This paper presents an innovative load management technique that can effectively lower the summer peak load by adjusting the aircondition loads through smoothe coordinations between utility companies and large customers. An intelligent hierarchical load management system composed of a Central Intelligent Load Management System(CIMS) and multiple Local Intelligent Management Systems(LIMS) is also proposed to implement the reposed technique. Upon receiving a load curtailment request from the utilities, CIMS issues tokens, which can be used by each LIMS as a right to turn on the airconditioner. CIMS creates and maintains a queue for fair allocation of the tokens among the LIMS demanding tokens. By adjusting the number tokens and queue management Policies, desired load factors can be achieved conveniently. The Markov Birth and Death Process and the Balance Equations are employed in estimating various queue performances. The proposed technique is tested using a summer load data of a large apartment complex and proved to be quite effective in load management while minimizing the customer inconveniences.