• 전자공학회논문지 IE
• /
• v.45 no.1
• /
• pp.50-57
• /
• 2008

It is applying the various teaming contents to improve learner's studying desire and effect in E-Learning system. In this learning contents, there are text animation, sound and picture etc. But, multimedia teaming contents which has big file size need much transmission service times. In this paper, I proposed a scheduling technique of LMS to be faster and service efficiently the multimedia learning contents which was managed and processed it in LMS. for this purpose, I used message and scheduler at LMS. While loaming was processed, it saved the result information of learning contents request to LMS. In this case, if the learner request loaming contents request, it could be possible to support the learning contents efficiently to use learning contents information in LMS without connecting to LCMS. As application result of this techniques, at the first learning course, existent techniques displayed faster learning contents service than proposal techniques. But the more learning process, proposal technique is faster service than existent.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.1
• /
• pp.37-41
• /
• 2018

In this paper, we evaluate the power consumption of IEEE802.15.4e TSCH which uses the specific link scheduling scheme proposed in reference[1]. And we also compares it with the power consumption of conventional single channel IEEE802.15.4. The power consumption of IEEE802.15.4e TSCH is smaller than the conventional one under the any conditions of traffic. The reasons can be explained as the followings. Firstly, TSCH does not have backoff time because of using the collision free link scheduling. Secondly, there is the timing difference of MAC offset parameter between TSCH and conventional IEEE802.15.4 Lastly, the devices in TSCH mode sleep during the time slots which are not assigned to itself.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.801-803
• /
• 2005

Fundamentally, success of the competitive electricity market is dependent on efficient market design. However, since electricity incorporates various physical constraints as other commodities, the resource assignment (i.e., dispatch scheduling) is also one of requisites for the successful operation of electricity market. Therefore, efficient dispatch scheduling is an important issue to succeed in the deregulated electricity market and the efficiency of this electricity market may be considerably increased by systematic studies on dispatch scheduling algorithm and corresponding constraints, especially system security. Moreover, contrary to traditional vertically-integrated electric power industry condition, since various decision-makings in deregulated electricity market are directly connected with market participants' benefits, only rational dispatch scheduling algorithm can convince these participants. Therefore, it can provide a basis of grievance prevention. In this paper, we propose an algorithm for security constrained dispatch scheduling with respect to load curtailment. Proposed algorithm decomposes the dispatch problem into a master problem corresponding to basecase optimal power flow (OPF) and several subproblems corresponding a series of contingencies using two-stage optimization technique.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.267-274
• /
• 2015

Due to the difficulty of coordination in the cellular uplink, it is a practical challenge how to achieve the optimal throughput scaling with distributed scheduling. In this paper, we propose a distributed and opportunistic user scheduling (DOUS) that achieves the optimal throughput scaling in a single-input multiple-output interfering multiple-access channel, i.e., a multi-cell uplink network, with M antennas at each base station (BS) and N users in a cell. In a distributed fashion, each BS adopts M random receive beamforming vectors and then selects M users such that both sufficiently large desired signal power and sufficiently small generating interference are guaranteed. As a main result, it is proved that full multiuser diversity gain can be achieved in each cell when a sufficiently large number of users exist. Numerical evaluation confirms that in a practical setting of the multi-cell network, the proposed DOUS outperforms the existing distributed user scheduling algorithms in terms of sum-rate.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.19-26
• /
• 2021

CPU is considered the main and most important resource in the computer system. The CPU scheduling is defined as a procedure that determines which process will enter the CPU to be executed, and another process will be waiting for its turn to be performed. CPU management scheduling algorithms are the major service in the operating systems that fulfill the maximum utilization of the CPU. This article aims to review the studies on the CPU scheduling algorithms towards comparing which is the best algorithm. After we conducted a review of the Round Robin, Shortest Job First, First Come First Served, and Priority algorithms, we found that several researchers have suggested various ways to improve CPU optimization criteria through different algorithms to improve the waiting time, response time, and turnaround time but there is no algorithm is better in all criteria.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.4
• /
• pp.385-398
• /
• 2009

This paper aims to find a suitable solution to joint allocation of sub-channel and transmit power for multiple users in an IEEE 802.16e OFDMA/TDD cellular system. We propose the FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm, which is a dynamic channel allocation algorithm that considers all of the users' channel state information conditionally in order to maximize throughput while taking into account fairness. A dynamic power allocation algorithm, i.e., an improved CHC algorithm, is also proposed in combination with the FASA algorithm. It collects the extra downlink transmit power and re-allocates it to other potential users. Simulation results show that the joint allocation scheme with the improved CHC power allocation algorithm provides an additional increase of sector throughput while simultaneously enhancing fairness. Four frames of time delay for CQI feedback and scheduling are considered. Furthermore, by addressing the difference between uplink and downlink scheduling in an IEEE 802.16e OFDMA TDD system, we can employ the uplink channel information directly via channel sounding, resulting in more accurate uplink dynamic resource allocation.

• The Journal of Society for e-Business Studies
• /
• v.20 no.1
• /
• pp.79-88
• /
• 2015

Many servers, such as web and database servers, receive a continual stream of requests. The servers should schedule these requests to provide the best services to users. In this paper, a hybrid genetic algorithm is proposed for scheduling divisible requests without interruption in which the objective is to minimize the total stretch. The stretch of a request is the ratio of the amount of time the request spent in the system to its response time. The hybrid genetic algorithm adopts the idea of seed selection and development in order to improve the exploitation and exploration power of genetic algorithms. Extensive computational experiments have been conducted to compare the performance of the hybrid genetic algorithm with that of genetic algorithms.

• Asia pacific journal of information systems
• /
• v.24 no.4
• /
• pp.417-441
• /
• 2014

Organizations need to exhibit characteristics of agility to stay ahead of their competitors and to survive in dynamic environments. One major concern for organizations is how to implement Information Systems (ISs) to enhance their agility. Organizations tend to spend too many resources to change their entire IS instead of only the components that cause problems without exactly knowing whether it enables or suppress organizational agility. To address these shortcomings and practical issues, we provide a framework to assess organizational agility and to diagnose a problem related to IS. By applying this prototype of the Agility Framework, we were able to diagnose a problem that the department of Management Control and Information Systems at the Universidad de Chile had and planned actions for them to improve its organizational agility with a course scheduling system, eClasSkeduler. This action research, which took more than 25-month for the first cycle, further develops the Agility Framework, which not only provides a way to link IS with organizational functions but also illustrates how to use it to diagnose a situation and plan actions for improving organizational agility through an information system.

• The Journal of Society for e-Business Studies
• /
• v.23 no.3
• /
• pp.1-12
• /
• 2018

Mixed-criticality systems consist of components with different criticality. Recently, components are categorized depending on criticality by ISO 26262 standard and DO-178B standard in automotive and avionic domain. Existing mixed-criticality system research achieved efficient and safe scheduling through system-level criticality mode. The drawback of these approaches is performance degradation of low-criticality tasks on high-criticality mode. Task-level criticality mode is one method to address the problem and improve the performance of low-critical tasks. In this paper, we propose probabilistic performance metric for the approach. In simulation results with probabilistic performance metric, we showed that our approach has better performance than the existing approaches.

• Korean Management Science Review
• /
• v.13 no.3
• /
• pp.37-48
• /
• 1996

This paper presents an Economic Lot Scheduling Problem in which controllable production rates are considered. We also take into account the controllable range of production rate (i.e., maximum and minimum production rate) of each product and the mold cost which varies to the production rate. A mathematical model is developed and an iterative solution procedure is suggested. The objective of this problem is to minimize production related cost and the decision variables are common production cycle time and production rate of each product. As a case study, we adapted this model to the press machine of a company.