• ETRI Journal
• /
• 제38권5호
• /
• pp.885-895
• /
• 2016

The lowest power mode (passive-standby mode) was proposed for reducing the power consumption of set-top boxes in a standby state when not receiving content. However, low-power set-top boxes equipped with the lowest power mode have been rarely commercialized because of their low-quality user experience. In the lowest power mode, they deactivates almost all of operational modules and processes, and thus require dozens of seconds for activation latency (that is, the latency for activating all modules of the set-top boxes in a standby state). They are not even updated in a standby state because they deactivate their network interfaces in a standby state. This paper proposes an adaptive standby mode scheduling method for improving the user experience of such boxes. Set-top boxes using the proposed method can analyze the activation pattern and find the frequently used time period (that is, when the set-top boxes are frequently activated). They prepare for their activation during this frequently used time period, thereby reducing the activation latency and enabling their update in a standby state.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1071-1090
• /
• 2016

Most of scheduling methods in the Grid only consider one special attribute of the resource or one aspect of QoS (Quality of Service) of the job. In this paper, we focus on the problem that how to consider two aspects simultaneously. Based on the requirements of the jobs and the attributes of the resources, jobs are categorized into three kinds: CPU-overload, memory-overload, and bandwidth-overload jobs. One job may belong to different kinds according to different attributes. We schedule the jobs in different categories in different orders, and then propose a scheduling method-MTS (multiple attributes scheduling method) to schedule Grid resources. Based on the comparisons between our method, Min-min, ASJS (Adaptive Scoring Job Scheduling), and MRS (Multi-dimensional Scheduling) show: (1) MTS reduces the execution time more than 15% to other methods, (2) MTS improves the number of the finished jobs before the deadlines of the jobs, and (3) MTS enhances the file size of transmitted files (input files and output files) and improves the number of the instructions of the finished jobs.

• Industrial Engineering and Management Systems
• /
• 제11권4호
• /
• pp.310-330
• /
• 2012

Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation and reduce the costs. In order to find an optimal solution to manufacturing scheduling problems, it attempts to solve complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. Genetic algorithm (GA) is one of the generic population-based metaheuristic optimization algorithms and the best one for finding a satisfactory solution in an acceptable time for the NP-hard scheduling problems. GA is the most popular type of evolutionary algorithm. In this survey paper, we address firstly multiobjective hybrid GA combined with adaptive fuzzy logic controller which gives fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and four crucial issues in the manufacturing scheduling including a mathematical model, GA-based solution method and case study in flexible job-shop scheduling problem (fJSP), automatic guided vehicle (AGV) dispatching models in flexible manufacturing system (FMS) combined with priority-based GA, recent advanced planning and scheduling (APS) models and integrated systems for manufacturing.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1622-1631
• /
• 2007

To realize the wireless packet scheduler which efficiently considers both the effect of adaptive modulation and coding (AMC) scheme due to variable wireless communication channel information from physical layer and the QoS differentiation of multimedia services from internet protocol (IP) layer, this paper proposes a new downlink AMC-based priority queuing (APQ) scheduler which combines AMC scheme and service priority method in multimedia services at the same time. The result of numerical analysis shows that the proposed APQ algorithm plays a role in increasing the number of services satisfying the mean waiting time requirements per each service in multimedia services because the APQ scheme allows the mean waiting time of each service to be reduced much more than existing packet scheduler having only user selection processor.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2018년도 제58차 하계학술대회논문집 26권2호
• /
• pp.209-210
• /
• 2018

본 논문에서는 IIoT 환경에서 효율적인 긴급 데이터 패킷 처리를 위한 스케쥴링 방식을 제안한다. 이는 weighted round robin 스케쥴링에 기반하고, 비선점형 시스템에 적용하는 방식으로 처리한다. 긴급 데이터의 평균 큐 사이즈에 따라 적응형으로 중요도를 조절함으로써 최적화시킨다. 이는 적은 패킷 손실률과 작은 딜레이로 이어진다. 이 적응형 스케쥴링 방식은 갑작스런 처리량의 변화에 많은 패킷 손실률과 딜레이 증가량 없이 대처하는 것에 효율적인 해결책이 될 것으로 기대된다.

• ETRI Journal
• /
• 제27권6호
• /
• pp.802-805
• /
• 2005

A dynamic bandwidth allocation (DBA) scheme, an inter -optical network unit (ONU) bandwidth scheduling, is presented to provide quality of service (QoS) to different classes of packets in Ethernet passive optical networks (EPONs). This scheme, referred to as TADBA, is based on efficient threshold reporting from, and adaptive polling order rearranging of, ONUs. It has been shown that the network resources are efficiently allocated among the three traffic classes by guaranteeing the requested QoS, adaptively rearranging the polling orders, and avoiding nearly all fragmentation losses. Simulation results using an OPNET network simulator show that TADBA performs well in comparison to the available allocation scheme for the given parameters, such as packet delay and channel utilization.

• 한국통신학회논문지
• /
• 제28권8A호
• /
• pp.613-619
• /
• 2003

블루투스는 무선으로 근거리 디바이스들을 연결하는 통신 기술로, 하나의 마스터와 하나 이상의 슬레이브 기기가 피코넷을 구성하고, 피코넷들이 연결되어 스캐터넷을 이루게 된다. 스캐터넷에서 여러 피코넷에 속하면서, 피코넷간 연결을 해주는 디바이스를 브릿지 또는 게이트웨이 노드라고 하는데 스캐터넷이 효율적으로 동작하도록 하기 위해서는 피코넷 내부의 마스터와 슬레이브 간의 효과적인 피코넷 스케줄링과 함께 브릿지 노드를 효과적으로 스케줄링 해주는 스캐터넷 스케줄링이 필요하다. 본 논문에서는 랑데부 포인트와 랑데부 윈도우를 이용한 스캐터넷 스케줄링 알고리즘과 함께 스니프 모드를 이용한 피코넷 스케줄링 알고리즘을 제안하고, 시뮬레이션을 통해 기존 방식과의 성능을 비교, 분석하였다. 그 결과 트래픽의 상태에 따라 링크에 할당되는 대역폭을 가변함으로써 무선자원을 효과적으로 분배할 수 있음을 보였다. 또한 제안된 알고리즘은 전력 소비 절약 모드인 스니프 모드의 사용으로 전력 소비를 절약할 수 있다는 장점을 갖는다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권4호
• /
• pp.1302-1320
• /
• 2015

In cloud, everything can be provided as a service wherein a large number of users submit their jobs and wait for their services. hus, scheduling plays major role for providing the resources efficiently to the submitted jobs. The brainwave of the proposed ork is to improve user satisfaction, to balance the load efficiently and to bolster the resource utilization. Hence, this paper roposes an Adaptive Multilevel Scheduling System (AMSS) which will process the jobs in a multileveled fashion. The first level ontains Preprocessing Jobs with Multi-Criteria (PJMC) which will preprocess the jobs to elevate the user satisfaction and to itigate the jobs violation. In the second level, a Deadline Based Dynamic Priority Scheduler (DBDPS) is proposed which will ynamically prioritize the jobs for evading starvation. At the third level, Contest Mapping Jobs with Virtual Machine (CMJVM) is roposed that will map the job to suitable Virtual Machine (VM). In the last level, VM Scheduler is introduced in the two-tier VM rchitecture that will efficiently schedule the jobs and increase the resource utilization. These contributions will mitigate job iolations, avoid starvation, increase throughput and maximize resource utilization. Experimental results show that the performance f AMSS is better than other algorithms.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권6호
• /
• pp.808-816
• /
• 2016

As the number of CPU/GPU cores and IPs in SOC increases and applications require explosive memory bandwidth, simultaneously achieving good throughput and fairness in the memory system among interfering applications is very challenging. Recent works proposed priority-based thread scheduling and channel partitioning to improve throughput and fairness. However, combining these different approaches leads to performance and fairness degradation. In this paper, we analyze the problems incurred when combining priority-based scheduling and channel partitioning and propose dynamic priority thread scheduling and adaptive channel partitioning method. In addition, we propose dynamic address mapping to further optimize the proposed scheme. Combining proposed methods could enhance weighted speedup and fairness for memory intensive applications by 4.2% and 10.2% over TCM or by 19.7% and 19.9% over FR-FCFS on average whereas the proposed scheme requires space less than TCM by 8%.

• 정보과학회 논문지
• /
• 제43권7호
• /
• pp.827-833
• /
• 2016

HTTP 적응적 스트리밍은 네트워크 상태에 따라 비디오의 품질을 조절하여 사용자 체감 품질을 향상시키는 비디오 스트리밍 서비스이다. HTTP 적응적 스트리밍 서비스에서 비디오 콘텐츠는 여러 품질과 일정 길이를 가지는 비디오 세그먼트로 나누어지며, 클라이언트는 적절한 품질의 세그먼트를 요청한다. 그러나 기존의 세그먼트 스케줄러는 TCP에 대한 고려 없이 일정 간격으로 세그먼트를 요청하므로 TCP 연결이 초기화되어 Slow-start를 다시 수행해 비디오 전송률이 감소한다. 본 논문에서는 HTTP 적응적 스트리밍 서비스의 품질을 향상시키기 위한 TCP 인지형 세그먼트 스케줄링 기법을 제안한다. 제안하는 기법은 TCP 연결이 초기화되는 것을 방지하기 위해 비디오 세그먼트의 요청 시간을 조절하며, 세그먼트를 요청하는 시점을 고려하여 안정적인 비디오 스트리밍을 수행한다. 시뮬레이션을 통해 제안하는 기법이 끊김 현상 없이 HTTP 적응적 스트리밍 서비스의 품질을 향상시키는 것을 확인하였다.