• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.1
• /
• pp.162-166
• /
• 2017

Earliest virtual deadline zero laxity (EVDZL) algorithm is proposed for mobile GPU schedulers for its improved responsiveness. Responsiveness of user interface (UI) is one of the key factors in evaluating smart devices because of its significant impacts on user experiences. However, conventional GPU schedulers based on completely fair scheduling (CFS) shows a poor responsiveness due to its algorithmic complexity. In this letter, we present the EVDZL scheduler based on the conventional earliest deadline zero laxity (EDZL) algorithm by accommodating the virtual laxity concept into the scheduling. Experimental results show that the EVDZL scheduler improves the response time of the Android UI by 9.6% compared with the traditional CFS scheduler.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.4
• /
• pp.193-199
• /
• 2012

Virtualization allows multiple commodity operating systems to share on a single physical machine. Resource allocation among virtual machines is a key to determine virtual machine performance. To satisfy time-sensitive task on a domain, hypervisor needs to observe the resource requirements and allocates proper amount of CPU resources in a timely manner. In this paper, we propose a realtime credit scheduler for latency sensitive application on virtual machines. The key idea is to register a time event in the Xen hypervisor. Experiment result shows that the proposed scheme is superior to Credit scheduler.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.3
• /
• pp.129-137
• /
• 2020

Kubernetes is one of the most widely used tool in cloud computing environments. It m anages POD as a basic operational unit, providing a isolated environments through container tech nology. Basically, its scheduler properly allocates POD, considering the utilizations of CPUs, mem ories and volumes on hosts. In our work, we develop a customized scheduling framework additio nally considering network resources. In the framework, we can monitor the dynamic variations of resources and make it possible to utilize the resources for the scheduler. This framework offers not only observing necessary information but also visualizing the data to scheduler for providing convenience.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.12
• /
• pp.58-66
• /
• 2001

Input queueing is useful for high bandwidth switches and routers because of lower complexity and fewer circuits than output queueing. The input queueing switch, however, suffers HOL-Blocking, which limits the throughput to 58%. To get around this low throughput, many input queueing switches have centralized scheduler, which centralized scheduler restrict the design of the switch architecture. To overcome this problem, we propose a simple scheduler called PRR(Pipelined Round Robin), which is intrinsically distributed and presents to show the effectiveness of the proposed scheduling.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1992.04a
• /
• pp.359-363
• /
• 1992

As the demands of manufacturing automation is increasing, lots of efforts are devoted to the applications of Computer Integrated Manufacturing(CIM) concept in manufacturing shop floor. A workstation is a computer which controls differnet machines in the low level of factory(shop floor). A workstation can be utilized efficiently to enhance the coopetative work of machines. A scheduler is a component program in a workstation and it controls the operation of machines according to a fixed plan. A scheme for the scheduler has been developed for selected machines and software has been made. The fixed plan is stored in a schedule file which keeps machine names, communications methods, information for communications and time for the usages, etc. The scheduler carries out its role by the information in the schedule file. Although the developed software has some Iimitations, the test results show that the scheduler can be applied easily to the automation of the low level of factory.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.71-78
• /
• 2007

In this paper, an effective task scheduling scheme was proposed for the flexible real time LINUX systems with the selection between EDF(earliest deadline first) and RMS(rate monotonic scheduling). It was known that many task scheduling schemes were analyzed according to the characteristics of scheduling schemes and the guarantee of an earliest deadline scheduler for process utilities.

• KIISE Transactions on Computing Practices
• /
• v.20 no.9
• /
• pp.519-524
• /
• 2014

The operating systems in the system architecture, which is integrated several applications and modular electronic devices in the same computing device, demand partitioning technology for safety. Thus, operation system requires partition scheduler for partition scheduling. When we design partition scheduler in embedded system, which has small memory and low performance, such as space system, we must consider not only performance but also memory. In this paper, we introduces a linux-based memory efficient partition scheduler using partition bitmap. This partition scheduler demands small memory space and produce low partition switching overhead. The prototype was executed on a LEON4 processor, which is the Next Generation Multicore Processor (NGMP) in the space sector. In evaluation, this prototype shows accuracy, additional memory space and low partition switching overhead.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.99-109
• /
• 2007

IEEE 802.lie is being proposed to improve QoS by IEEE 802.11 working group. HCCA (HCF Controlled Channel Access) a centralized polling based mechanism of IEEE 802.11e, needs a scheduling algorithm that decides on how the available radio resources are allocated to the polled STAs. In IEEE 802.l1e standard Reference Scheduler is presented. Reference Scheduler Polls all STAs in a polling list by the same interval that causes ineffectively frequent polling. It increases not only the overhead but it decreases the TXOP (Transmission Opportunity) utilization. In this paper, we propose the scheduling and admission control algorithm that poll stations depending on the MSI (Maximum Service Interval)o( stations to solve these shortcomings. In our proposed algorithm a station is polled by an interval close to its MSI, so polling overhead decrease and TXOP utilization increases than Reference Scheduler. Simulation results show that our algorithm outperforms Reference Scheduler. Our algorithm maintains higher aggregate throughput and services mere stations than Reference Scheduler.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.373-376
• /
• 2003

This paper presents a new, three-dimensional round-robin scheduler that provides high throughput and fair across in an advanced input-queued packet switch using shared input buffers. We consider an architecture in which each input port group shares a common buffer and maintains a separate queue for each output, which is ratted the distributed common input buffer switch. In an NxN switch, our scheduler determines which queue in the total MxN input queues is served during each time slot where M is the number of common buffers. We suppose that each common buffer has K input ports and K output ports, and manages N output queues. The 3DRR scheduler determines MxK queues in every K(M) cycle when $K\geq$M (K$\leq$M), and provides massively parallel processing for the applications of high-speed switches with a large number of ports. The 3-DRR scheduler can be implemented using duplicated simple logic components allowing very high-speed implementation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1164-1174
• /
• 2007

Antenna selection based MIMO schedulers are proposed to achieve the optimal performance with low complexity in uplink multiuser MIMO/FDD system. In this paper, three heuristic schedulers are proposed to approach the optimal performance which is achieved by the optimal Brute-Force Scheduler. Two search methods called sub-set and full-set way are also discussed to set up the antenna channels to be the candidates of the scheduler. Simulation results show that the sum rate and BER performance of the proposed CSS and SOAS schemes are about the same to that of the brute-force scheduler with affordable complexity, while RC-SOAS with further reduced complexity achieves almost the optimal performance in the case of small number of antennas. Moreover, the complexity can be additionally reduced by the sub-set search method when the number of transmit and receive antennas are 2 respectively, which is applicable in the realistic systems.