• Journal of Korea Game Society
• /
• v.15 no.6
• /
• pp.97-106
• /
• 2015

In an Unity engine for multi-player online games, the main thread processing game logic must be separated from the network thread that is responsible for network packet communication. Packet communication between the network threads needs to drop packets that overlap in order to improve the rendering speed. In this paper, the packet discard policy of network thread is proposed for an Unity engine for multi-player online games. The proposed method is the hybrid method of both Partial Packet Discard and Periodic Packet Discard methods to improve the rendering speed by periodically discarding overlapped network packets managed by the queue. The rendering speed of the proposed method is analyzed and its effectiveness is verified by various packet generating simulations of the Unity engine for multi-player online games.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9A
• /
• pp.837-843
• /
• 2006

IEEE802.15.3 and IEEE802.15.4 have defined the hybrid MAC protocols based on TDMA and CSMA where a multi-frame TDMA structure is employed so that multiple data frames can be transmitted within one timeslot to guarantee minimum delay bounds of isochroous traffic. However, TDMA has an intrinsic problem that cannot dynamically allocate optimal length of timeslot to each station. Therefore the idle timeslot can be produced by stations when each transmission queue is instantaneously empty during its timeslot, which would waste lots of timeslots especially in the multi-frame TDMA systems. In this paper, we propose a more flexible multiple-access scheme for the multi-frame TDMA system based on the concept of virtual slot which is accessible by every station with the highest priority for slot owner and lower priority for other stations. Finally, our simulation results from various environments show that proposed scheme can achieve magnitude improvement of total system throughput and average message delay by maximizing channel utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.512-521
• /
• 2002

Recently, conventional superscalar RISC processors arrive their performance limit, and many researches on the next-generation architecture are concentrated on SMT(Simultaneous Multi-Threading). In SMT processors, multiple threads are executed simultaneously and share hardware resources dynamically. In this case, it is more important to supply instructions from multiple threads to processor core efficiently than ever. Because SMT architecture shows higher IPC(Instructions per cycle) than superscalar architecture, performance is influenced by fetch bandwidth and the size of fetch queue. Moreover, to use TLP(Thread Level Parallelism) efficiently, fetch thread selection algorithm and fetch bandwidth for each selected threads must be carefully designed. Thus, in this paper, the performance values influenced by these factors are analyzed. Based on the results, an optimal instruction fetch strategy for SMT processors is proposed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.193-214
• /
• 2017

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.105-112
• /
• 1997

The performance of a shared memory multiprocessor system is very sensitive to process scheduling. w can enhance the performance of a whole system as well as of an individual process by taking the multiprocessor characteristics into account in the design of the process scheduler. In this paper, we proposed a general purpose scheduler for a shared memory multiprocessor, called the Two-Level Multi-Scan (TLMS) process scheduler, that considers the processor affinity loosely and decreases the interference among multiple processors greatly. The TLMS scheduler is composed of a local scheduler at each processor and a semi-global scheduler that balances the load among processors. In particular, the semi-global scheduler tries to minimize priority inversion, which is an important factor of the system performance. The TLMS scheduler also tries to reduce the number of resources to be shared and improves the processor utilization. to meet these requirements, th semi-global scheduler interacts with the operation of the local scheduler when a need arises, thus the name is loose processor-affinity. We also show that the proposed scheduling technique can be extended for other types of resources making it a general purpose resource management queue.

• Journal of the Korea Society for Simulation
• /
• v.8 no.3
• /
• pp.49-66
• /
• 1999

Semiconductor wafer fabrication is known to be one of the most complex manufacturing processes due to process intricacy, random yields, product diversity, and rapid changing technologies. In this study we are concerned with the impact of lot release and dispatching policies on the performance of semiconductor wafer fabrication facilities. We consider several semiconductor wafer fabrication environments according to the machine failure types such as no failure, normal MTBF, bottleneck with low MTBF, high randomness, and high MTBF cases. Lot release rules to be considered are Deterministic, Poisson process, WR(Workload Regulation), SA(Starvation Avoidance), and Multi-SA. These rules are combined with several dispatching rules such as FIFO (First In First Out), SRPT (Shortest Remaining Processing Time), and NING/M(smallest Number In Next Queue per Machine). We applied the combined policies to each of semiconductor wafer fabrication environments. These policies are assessed in terms of throughput and flow time. Basically Weins fabrication setup was used to make the simulation models. The simulation parameters were obtained through the preliminary simulation experiments. The key results throughout the simulation experiments is that Multi-SA and SA are the most robust rules, which give mostly good performance for any wafer fabrication environments when used with any dispatching rules. The more important result is that for each of wafer fabrication environments there exist the best and worst choices of lot release and dispatching policies. For example, the Poisson release rule results in the least throughput and largest flow time without regard to failure types and dispatching rules.

• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.601-616
• /
• 2021

Retrial queueing models have been studied extensively in the literature. These have many practical applications, especially in service sectors. However, retrial queueing models have their own limitations. Typically, analyzing such models involve level-dependent quasi-birth-and-death processes, and hence some form of a truncation or an approximate method or simulation approach is needed to study in steady-state. Secondly, in general, the customers are not served on a first-come-first-served basis. The latter is the case when a new arrival may find a free server while prior arrivals are waiting in the retrial orbit due to the servers being busy during their arrivals. In this paper, we take a different approach to the study of multi-server retrial queues in which the signals are generated in such a way to provide a reasonably fair treatment to all the customers seeking service. Further, this approach makes the study to be level-independent quasi-birth-and-death process. This approach is different from any considered in the literature. Using matrix-analytic methods we analyze MAP/M/c-type retrial queueing models along with Poisson signals in steady-state. Illustrative numerical examples including a comparison with previously published retrial queues are presented and they show marked improvements in providing a quality of service to the customers.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.5
• /
• pp.133-142
• /
• 2004

Recently, the growth of Internet and a variety of multimedia services through Internet increasingly demands high-speed packet transmission, the new routing function, and QoS guarantee on conventional routers. Thus, a new switching mechanical called the MPLS(Multi-Protocol Label Switching), was proposed by IETF(Internet Engineering Task Force) as a solution to meet these demands. In addition the deployment of MPLS network supporting Differentiated Services is required. In this paper, we propose the architecture of the MPLS switch supporting Differentiated Services in the MPLS-based network. The traffic conditioner consists of a classifier, a meter, and a marker. The VOQ-PHB module, which combines input Queue with each PHB queue, is implemented to utilize the resources efficiently. It employs the Priority-iSLIP scheduling algorithm to support high-speed switching. We have designed and verified the new and fast hardware architecture of VOQ-PHB and the traffic conditioner for QoS and high-speed switching using NS-2 simulator. In addition, the proposed architecture is modeled in VHDL, synthesized and verified by the VSS analyzer from SYNOPSYS. Finally, to justify the validity of the hardware architecture, the proposed architecture is placed and routed using Apollo tool.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.585-594
• /
• 2008

The issues that we should consider in the process of providing mobile web service using a mobile device are seamless service and QoS-guaranteed service. HMIPv6 has MAP because of improving packet loss and transmission delay due to disconnection. However, a load is concentrated on HMIPv6 because of receiving and delivering packet for MN. Owing to this, real time data fails to be processed quickly, and also adaptive mobile service is required for QoS guaranteed service. However, this method demands the response time cost of contents service owing to the hardware differences of various devices. Therefore, we improve the process performance of real time data by applying a queue in MAP for seamless service in this paper. For decreasing response time cost, we propose mobile web service method which has reusable cache of contents using the elements of contents. The result of a numerical formula and simulation shows that our proposed method is superior under various system conditions.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.237-244
• /
• 2009

The congestion in wireless sensor network increases the ratio of data loss and causes the delay of data. The existing congestion protocols for wireless sensor network reduces the amount of transmission by control the sampling frequency of the sensor nodes related to the congestion when the congestion has occurred and was detected. However, the control method of sampling frequency is not applicable on the situation which is sensitive to the temporal data loss. In the paper, we propose a new congestion control, ACT - Adaptive Congestion conTrol. The ACT monitors the network traffic with the queue usage and detects the congestion based on the multi level threshold of queue usage. Given network congestion, the ACT increases the efficiency of network by adaptive flow control method which adjusts the frequency of packet transmission and guarantees the fairness of packet transmission between nodes. Furthermore, ACT increases the quality of data by using the variable compression method. Through experiment, we show that ACT increases the network efficiency and guarantees the fairness to sensor nodes compared with existing method.