• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.3
• /
• pp.145-154
• /
• 2006

WiBro (Wireless Broadband Internet) system is going to be 9ot down to commercialization. The high portable internet system is able to be connected to the high-speed internet using 2.3 GHz frequency bandwidth, anytime and anywhere. An effective scheduling for UGS, rtPS, nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that are the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities with each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.347-353
• /
• 2005

WiBro (Wireless Broadband Internet) system is going to be commercialized before long. The high portable internet system is abie to be connected to the high-speed internet using 2.3 CHz frequency bandwidth, anytime and anywhere. An effective scheduling for UCS, rtPS. nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that arc the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities With each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1667-1676
• /
• 2010

In this paper, we propose a packet scheduling algorithm that assigns different number of HS-PDSCH(High Speed Primary Downlink Shared Channel) to the service user according to the received signal to interference ratio of CPICH(Common Pilot Channel) and to the traffic characteristics. Assigned channel number is determined by the signal to interference ratio level from CPICH. The highest signal to interference ratio user gets the number of channels based on the signal to interference ratio table and the remained channels are assigned to the other level users. Therefore the proposed scheme can provide the similar maximum service throughput and higher fairness than existing scheduling algorithm. Simulation results show that our algorithm can provide the similar maximum service throughput and higher fairness than MAX C/I algorithm and can also support the higher service throughput than proportional fairness scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5A
• /
• pp.469-474
• /
• 2006

In this paper, we develop a method that derive the average sector throughput of HSDPA system. This proposed method reflects the effects of AMC, scheduling and multi-code transmission, and is performed by simple calculation procedures such as link budget analysis. Link budget table is used to estimate a cell coverage in general. We modify the link budget table in order to calculate C/I of the user according to the location of the user in CDMA packet system employing AMC. Furthermore, we utilize the proposed method to analyze the effects of scheduling and multi-code transmission.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3516-3541
• /
• 2018

Task scheduling is one of the most challenging aspects of cloud computing nowadays, and it plays an important role in improving overall performance in, and services from, the cloud, such as response time, cost, makespan, and throughput. A recent cloud task-scheduling algorithm based on the symbiotic organisms search (SOS) algorithm not only has fewer specific parameters, but also incurs time complexity. SOS is a newly developed metaheuristic optimization technique for solving numerical optimization problems. In this paper, the basic SOS algorithm is reduced, and chaotic local search (CLS) is integrated into the reduced SOS to improve the convergence rate. Simulated annealing (SA) is also added to help the SOS algorithm avoid being trapped in a local minimum. The performance of the proposed SA-CLS-SOS algorithm is evaluated by extensive simulation using the Matlab framework, and is compared with SOS, SA-SOS, and CLS-SOS algorithms. Simulation results show that the improved hybrid SOS performs better than SOS, SA-SOS, and CLS-SOS in terms of convergence speed and makespan.

• Proceedings of the KSR Conference
• /
• 1998.05a
• /
• pp.23-30
• /
• 1998

The construction of the transportation history database system is to serve the scheduling and seat inventory controling. Recently, lots of countries have been faced with the advance era because of the new railway transportation system, like the high speed railway and/or magnetic levitation vehicle system. This can be reasonably translated as those of operators are willing to provide the more various and high quality schedule to the customer. Those operators' these ideas make possible to forecast that scheduling process is going to be complicated more and more The seat inventory control, so to speak Yield Management System(YMS), goes a long way to improve the total passenger revenue at the railway business. The YMS forecasts the number of the last reservation value(DCP# END) and recommends the optimal values on the seat sales. The history database system contains infra-data(ie, train, seat, sales) that will be the foundation of scheduling and seat inventory control application programs. The development of the application programs are reserved to the next step. The database system is installed on the pc platform(IBM compatible), using the DB2(RDBMS). And at next step, the platform and DBMS will be considered whether they can meet the users' requirement or not.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.3
• /
• pp.123-133
• /
• 2011

The advanced planning and scheduling(APS) is an well known enterprise information system that provides optimal production schedules and supports to complete production on time by solving the complex scheduling problems including capacity and due dates. In this paper, we focused on the improvement of the APS that is already established on a real company. The existing APS had several drawbacks, thus utilization and satisfaction were very low. We performed the focused group interviews and the process analysis and could find that the end users and developers have various objectives and the frequently used functions are different. We applied the analytical hierarchy process(AHP) to converge opinions of them on quantitative data. The results show that it is necessary to enhance visibility, to improve user interfaces and response speed, and to reconcile the real business process and the APS's process.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.523-530
• /
• 2016

We use both theoretical analysis and simulations to study the impact of crosspoint-queued (CQ) buffer size on CQ switch throughput and delay performance under different traffic models, input loads, and scheduling algorithms. In this paper, we present the following. 1) We prove the stability of CQ switch using any work-conserving scheduling algorithm. 2) We present an exact closed-form formula for the CQ switch throughput and a non-closed-form but convergent formula for its delay using static non-work-conserving random scheduling algorithms with any given buffer size under independent Bernoulli traffic. 3) We show that the above results can serve as a conservative guide on deciding the required buffer size in pure CQ switches using work-conserving algorithms such as the random scheduling, under independent Bernoulli traffic. 4) Furthermore, our simulation results under real-trace traffic show that simple round-robin and random work-conserving algorithms can achieve quite good throughput and delay performance with a feasible crosspoint buffer size. Our work reveals the impact of buffer size on the CQ switch performance and provides a theoretical guide on designing the buffer size in pure CQ switch, which is an important step toward building ultra-high-speed switch fabrics.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.147-153
• /
• 2007

Task scheduling is an essential part of any computer system for allocating tasks to a processor of the system among various competitors. As we know, in real-time system, the failure of scheduling a hard real-time task my lead to disastrous consequence. Besides efficiency, resource and speed, real-time system has to take time constraint in serious consideration. This paper proposes a priority-driven scheduling algorithm for real-time multiprocessor system. which is called L-RE coordinates algorithm. L-RE coordinates is a new way of describing the task scheduling problem. In the algorithm, we take both deadline and laxity into consideration for allocating the priority. The simulation result shows that the new algorithm is viable and performance better than EDF and LLF algorithm on schedulability and context switch respectively.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.4
• /
• pp.140-146
• /
• 2002

High speed rotating machines can be very sensitive to rotating mass unbalance that is a major source of harmful vibration for many types of rotating machinery. So, the balancing procedure is needed for all high-speed rotating system. To save the time and cost of off-line balancing, many researchers have developed the on-line balancing devices and methods. In this paper, an active balancing device, which is an electro-magnetic type, is developed and the active balancing algorithm using influence coefficient method is also proposed. The active balancing experiment for flexible rotors during operation is performed by an active balancing device. As a result, controlled unbalance responses are below the vibration limit at all rotating speed ranges with critical speed.