• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.702-709
• /
• 2003

In this paper, we propose an efficient and QoS-aware MAC scheduling algorithm for Bluetooth, which considers both throughput and delay performance of each Master-Slave pair in scheduling decisions, and thus, attempts to maximize overall performance. The proposed algorithm, MTDPP (Modified Throughput-Delay Priority Policy), makes up for the drawbacks of T-D PP (Throughput-Delay Priority Policy) proposed in [6] and improves the performance. Since Bluetooth employs a master-driven TDD based scheduling algorithm, which is basically operated with the Round Robin policy, many slots may be wasted by POLL or NULL packets when there is no data waiting for transmission in queues. To overcome this link wastage problem, several algorithms have been proposed. Among them, queue state-based priority policy and low power mode-based algorithm can perform with high throughput and reasonable fairness. However, their performances may depend on traffic characteristics, i.e., static or dynamic, and they require additional computational and signaling overheads. In order to tackle such problems, we propose a new scheduling algorithm. Performance of our proposed algorithm is evaluated with respect to throughput and delay. Simulation results show that overall performances can be improved by selecting suitable parameters of our algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.8
• /
• pp.619-630
• /
• 2003

We present a method of runtime configuration scheduling in reconfigurable SoC design. As a model of computation, we use a popular formal model of computation, hierarchical FSM (HFSM) with synchronous dataflow (SDF) model, in short, HFSM-SDF model. In reconfigurable SoC design with HFSM-SDF model, the problem of configuration scheduling becomes challenging due to the dynamic behavior of the system such as concurrent execution of state transitions (by AND relation), complex control flow (HFSM), and complex schedules of SDF actor firing. This makes it hard to hide configuration latency efficiently with compile-time static configuration scheduling. To resolve the problem, it is necessary to know the exact order of required configurations during runtime and to perform runtime configuration scheduling. To obtain the exact order of configurations, we exploit the inherent property of HFSM-SDF that the execution order of SDF actors can be determined before executing the state transition of top FSM. After obtaining the order information and storing it in the ready configuration queue (ready CQ), we execute the state transition. During the execution, whenever there is FPGA resource available, a new configuration is selected from the ready CQ and fetched by the runtime configuration scheduler. We applied the method to an MPEG4 decoder and IS95 design and obtained up to 21.8% improvement in system runtime with a negligible overhead of memory usage.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.21-27
• /
• 2020

In this paper, a hybrid scheduling algorithm is proposed for CMS(Combat Management System) to improve QoS(Quality of Service) based on DWDRR(Dynamic Weighted Deficit Round Robin) and priority-based scheduling method. The main proposed scheme, DWDRR is method of packet transmission through giving weight by traffic of queue and priority. To demonstrate an usefulness of proposed algorithm through simulation, efficiency in special section of the proposed algorithm is proved. Therefore, We propose hybrid algorithm between existing algorithm and proposed algorithm. Also, to prevent frequent scheme conversion, a hysteresis method is applied. The proposed algorithm shows lower packet loss rate and delay in the same traffic than existing algorithm.

• Journal of Korean Society for Quality Management
• /
• v.47 no.4
• /
• pp.823-835
• /
• 2019

Purpose: This study deals with a production planning and scheduling problem to minimize the total weighted tardiness on hybrid flow shop with sets of non-identical parallel machines on stages, where parallel machines in the set are dedicated to perform specific subsets of jobs and sequence-dependent setup times are also considered. Methods: A two-stage approach, that applies MILP model in the 1st stage and dispatching rules in the 2nd stage, is proposed in this paper. The MILP model is used to assign jobs to a specific machine in order to equalize the workload of the machines at each stage, while new dispatching rules are proposed and applied to sequence jobs in the queue at each stage. Results: The proposed two-stage approach was implemented by using a commercial MILP solver and a commercial simulation software and a case study was developed based on the spark plug manufacturing process, which is an automotive component, and verified using the company's actual production history. The computational experiment shows that it can reduce the tardiness when used in conjunction with the dispatching rule. Conclusion: This proposed two-stage approach can be used for HFS systems with dedicated machines, which can be evaluated in terms of tardiness and makespan. The method is expected to be used for the aggregated production planning or shop floor-level production scheduling.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.631-640
• /
• 2001

Round robin scheduling discipline, which is a sort of frame-based scheduling, is quite simple and straightforward for handling multiple queues, and by putting a different weight on each queue, a network can offer differentiated services such as different bandwidth, or delay bound. The most typical algorithm among this disciplines is the weighted round robin(WRR). Also, WRR algorithm can be implemented efficiently by dynamic binary scheduling wheel(DBSW) architecture. This paper performs the analysis of the DBSW architecture and compares the results with simulation results. The analysis data and simulation data show that the DBSW structure decreases average buffer length because it is capable of maintaining the allocated weight of each VC correctly.

• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.39-47
• /
• 2007

The scheduling algorithms to provide quality of service (QoS) in broadband convergence network (BcN) are compared and analysed. The main QoS management methods such as traffic classification, traffic processing in the input queue and weighted queueing are first analysed, and then the major scheduling algorithms of round robin, priority and weighted round robin under recently considering for BcN to supply real time multimedia communications are analysed. The simulation results by NS-2 show that the scheduling algorithm with proper weights for each traffic class outperforms the priority algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.6
• /
• pp.225-236
• /
• 2003

In this paper, we propose a wireless scheduling algorithm to provide the Internet delay proportional differentiated services in wireless networks. For considering network environments that have burst and location-dependent channel errors, our proposed WDPS(Wireless Delay Proportional Service) scheduling algorithm adaptively serves packets in class queues based on the delivered delay performance for each class. The remarkable characteristics of WDPS scheduler are supporting a fair relative delay service, providing graceful throughput and delay compensation, and avoiding class queue blocking problem. Through simulations, we show that the algorithm achieves the desirable properties to provide delay proportional services in wireless networks.

• Management Science and Financial Engineering
• /
• v.2 no.1
• /
• pp.123-145
• /
• 1996

We consider a priority-based multiclass queue with probabilistic feed-back. There are J service stations. Each customer belongs to one of the several priority classes, and the customers of each class arrive at each station in a Poisson process. A single server serves queued customers on a priority basis with a nonpreemptive scheduling discipline. The customers who complete their services feed back to the system instantaneously and join one of the queues of the stations or depart from the system according to a given probability. In this paper, we propose a new method to simplify the analysis of these queueing systems. By the analysis of busy periods and regenerative processes, we clarify the underlying system structure, and systematically obtain the mean for the sojourn time, i.e., the time from the arrival to the departure from the system, of a customer at every station. The mean for the number of customers queued in each station at an arbitrary time is also obtained simultaneously.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.259-261
• /
• 2006

그리드 시스템은 지리적으로 분산된 컴퓨팅 자원들을 네트워크로 연동하여 공유할 수 있도록 하는 통신 서비스의 일종이라 할 수 있으며, 향후 그리드 미들웨어를 통한 다수의 응용 그리드들이 구축될 것으로 예상된다. 본 논문에서는 우선순위가 높은 작업은 예약이 가능한 작업 큐(Job Queue)로 분배하고 우선순위가 낮은 작업은 백필이 가능한 백필 큐(Backfill Queue)로 할당시키면서, 백필 효율성을 증대시킬 뿐만 아니라 전체 그리드 시스템의 성능을 향상시킬 수 있는 혼합 백필 스케줄링 기법을 제안한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.4
• /
• pp.18-26
• /
• 2006

여러 형태의 고객이 외부로부터 포아송과정에 따라 각 대기행렬에 도착하고 정해진 서비스규칙에 따라 해당 서비스를 받은 후 마코비안 확률분포에 따라 시스템을 떠나거나 다른 형태의 고객으로 시스템을 다시 돌아 올 수도 있는 M/G/1 대기행렬시스템을 고려한다. 본 연구에서는 기존의 연구 모형을 확장하여 계층적 서비스 규칙을 갖는 우선순위 대기행렬모형을 제시하고 이에 대한 시스템 성능척도를 보다 체계적으로 구할 수 있는 방법을 소개한다. 이를 위하여 먼저 대기행렬시스템의 거동을 나타내는 시스템 상태를 정의하고, 바쁜기간과 서비스기간 분석을 통하여 시스템 상태의 선형 함수로 평균체제시간을 구할 수 있음을 보인다.