• Title/Summary/Keyword: Process scheduling algorithm

Search Result 243, Processing Time 0.027 seconds

Ecological flow calculations and evaluation techniques: Past, present, and future

  • LIU Yang;Wang Fang
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2023.05a
    • /
    • pp.28-28
    • /
    • 2023
  • Most countries worldwide are finding it difficult to make decisions regarding the utilization of water resources and the ecological flow protection of rivers because of serious water shortages and global climate warming. To overcome this difficulty, accurate ecological flow processes and protected ecological objectives are required. Since the introduction of the concept, ecological flow calculations have been developed for more than 60 years. This technical development has always been dominated by countries such as the United States, Australia, and the United Kingdom. The technical applications, however, vary substantially worldwide. Some countries, for instance, did not readjust the method because of a lack of understanding of the ecological effect or because they failed to achieve elaborate scheduling. Mostly, readjustments were not made because the users could not make their choices from among numerous methods for ecological flow. This paper presents three research results based on a systematic review of 240 methods with clear connotation boundaries. First, the ecological flow algorithm was developed along with the scientific and technological progress in the river ecosystem theory, ecohydrological relationship, and characterization and simulation of hydrological and hydrodynamic processes. In addition, the basis of the method has evolved from the hydrological process of the ecosystem, hydraulics-habitat conditions, and social development interference to whole ecosystem simulation. Second, 240 methods were classified into 50 sub-categories to evaluate their advantages and disadvantages according to the ecological flow algorithms of hydrology, hydraulics, habitat, and other comprehensive methods. According to this evaluation, 60% of the methods were not suitable for further application, including the method based on the percentage of natural runoff. Furthermore, the applicability of the remaining methods was presented according to the evaluation based on the aspects of allocation of water resources, water conservancy project scheduling, and river ecological evaluation. Third, In the future, most developing countries should strengthen the guarantee of high-standard ecological flow via a coordination mechanism for the ecological flow guarantee established under a sustainable framework or via an ecological protection pattern at the national level according to the national system. Concurrently, a reliable ecological flow demand process should also be established on the basis of detailed investigation and research on the relationship between river habitats, ecological hydrology, and ecological hydraulics. This will ensure that the real-time evaluation of ecological flow forces the water conservancy project scheduling and accurate allocation of water.

  • PDF

Improved Dispatching Algorithm for Satisfying both Quality and Due Date (품질과 납기를 동시에 만족하는 작업투입 개선에 관한 연구)

  • Yoon, Ji-Myoung;Ko, Hyo-Heon;Baek, Jong-Kwan;Kim, Sung-Shick
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.6
    • /
    • pp.1838-1855
    • /
    • 2008
  • The manufacturing industry seeks for improvements in efficiency at the manufacturing process. This paper presents a method for effective real time dispatching for parallel machines with multi product that minimizes mean tardiness and maximizes the quality of the product. What is shown in this paper is that using the Rolling Horizon Tabu search method in the real time dispatching process, mean tardiness can be reduced to the minimum. The effectiveness of the method presented in this paper has been examined in the simulation and compared with other dispatching methods. In fact, using this method manufacturing companies can increase profits and improve customer satisfaction as well.

A New Resource Allocation Algorithm of Functional Units to Minimize Power Dissipation (전력소비 최소화를 위한 새로운 펑션유닛의 자원 할당 알고리듬)

  • Lin, Chi-Ho
    • Journal of IKEEE
    • /
    • v.8 no.2 s.15
    • /
    • pp.181-185
    • /
    • 2004
  • This paper reduces power dissipation with the minimum switching activity of functional units that have many operators. Therefore, it has more effects of power dissipation that operator dissipation to reduce power dissipation of whole circuit preferentially. This paper proposes an algorithm that minimize power dissipation in functional units operations that affect much as power dissipation in VLSI circuit. The algorithm has scheduled operands using power library that has information of all operands. The power library upgrades information of input data in each control step about all inputs of functional units and the information is used at scheduling process. Therefore, the power dissipation is minimized by functional units inputs in optimized data. This paper has applied algorithm that proposed for minimizing power dissipation to functional unit in high level synthesis. The result of experiment has effect of maximum 9.4 % for minimizing power dissipation.

  • PDF

An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks (연결 지향 네트워크에서 최초 가용 구간을 찾는 효율적인 알고리즘)

  • Chong, Kyun-Rak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.3
    • /
    • pp.73-80
    • /
    • 2010
  • The advancement of communication and networking technologies has enabled e-science and commercial application that often require the transport of large volume of data over wide-area network. Schedulable high-bandwidth low-latency connectivity is required to transport the large volume of data. But the public Internet does not provide predictable service performance. Especially, if data providers and users are far away, dedicated bandwidth channels are needed to support remote process efficiently. Currently several network research projects are in progress to develop dedicated connectionsy sA bandwidth scheduler computes an user requested path based on network topology information and link bandwidth allocationsy In this paper, we have proposed an efficient algorithm for finding the earliest time interval when minimum bandwidth and duration are giveny Our algorithm is experimentally compared with the known algorithm.

Modeling Planned Maintenance Outage of Generators Based on Advanced Demand Clustering Algorithms (개선된 수요 클러스터링 기법을 이용한 발전기 보수정지계획 모델링)

  • Kim, Jin-Ho;Park, Jong-Bae
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.55 no.4
    • /
    • pp.172-178
    • /
    • 2006
  • In this paper, an advanced demand clustering algorithm which can explore the planned maintenance outage of generators in changed electricity industry is proposed. The major contribution of this paper can be captured in the development of the long-term estimates for the generation availability considering planned maintenance outage. Two conflicting viewpoints, one of which is reliability-focused and the other is economy-focused, are incorporated in the development of estimates of maintenance outage based on the advanced demand clustering algorithm. Based on the advanced clustering algorithm, in each demand cluster, conventional effective outage of generators which conceptually capture maintenance and forced outage of generators, are newly defined in order to properly address the characteristic of the planned maintenance outage in changed electricity markets. First, initial market demand is classified into multiple demand clusters, which are defined by the effective outage rates of generators and by the inherent characteristic of the initial demand. Then, based on the advanced demand clustering algorithm, the planned maintenance outages and corresponding effective outages of generators are reevaluated. Finally, the conventional demand clusters are newly classified in order to reflect the improved effective outages of generation markets. We have found that the revision of the demand clusters can change the number of the initial demand clusters, which cannot be captured in the conventional demand clustering process. Therefore, it can be seen that electricity market situations, which can also be classified into several groups which show similar patterns, can be more accurately clustered. From this the fundamental characteristics of power systems can be more efficiently analyzed, for this advanced classification can be widely applicable to other technical problems in power systems such as generation scheduling, power flow analysis, price forecasts, and so on.

The Design of a High-Performance RC4 Cipher Hardware using Clusters (클러스터를 이용한 고성능 RC4 암호화 하드웨어 설계)

  • Lee, Kyu-Hee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.7
    • /
    • pp.875-880
    • /
    • 2019
  • A RC4 stream cipher is widely used for security applications such as IEEE 802.11 WEP, IEEE 802.11i TKIP and so on, because it can be simply implemented to dedicated circuits and achieve a high-speed encryption. RC4 is also used for systems with limited resources like IoT, but there are performance limitations. RC4 consists of two stages, KSA and PRGA. KSA performs initialization and randomization of S-box and K-box and PRGA produces cipher texts using the randomized S-box. In this paper, we initialize the S-box and K-box in the randomization of the KSA stage to reduce the initialization delay. In the randomization, we use clusters to process swap operation between elements of S-box in parallel and can generate two cipher texts per clock. The proposed RC4 cipher hardware can initialize S-box and K-box without any delay and achieves about 2 times to 6 times improvement in KSA randomization and key stream generation.

Implementation of A Multiple-agent System for Conference Calling (회의 소집을 위한 다중 에이전트 시스템의 구현)

  • 유재홍;노승진;성미영
    • Journal of Intelligence and Information Systems
    • /
    • v.8 no.2
    • /
    • pp.205-227
    • /
    • 2002
  • Our study is focused on a multiple-agent system to provide efficient collaborative work by automating the conference calling process with the help of intelligent agents. Automating the meeting scheduling requires a careful consideration of the individual official schedule as well as the privacy and personal preferences. Therefore, the automation of conference calling needs the distributed processing task where a separate calendar management process is associated for increasing the reliability and inherent parallelism. This paper describes in detail the design and implementation issues of a multiple-agent system for conference calling that allows the convener and participants to minimize their efforts in creating a meeting. Our system is based on the client-sewer model. In the sewer side, a scheduling agent, a negotiating agent, a personal information managing agent, a group information managing agent, a session managing agent, and a coordinating agent are operating. In the client side, an interface agent, a media agent, and a collaborating agent are operating. Agents use a standardized knowledge manipulation language to communicate amongst themselves. Communicating through a standardized knowledge manipulation language allows the system to overcome heterogeneity which is one of the most important problems in communication among agents for distributed collaborative computing. The agents of our system propose the dates on which as many participants as possible are available to attend the conference using the forward chaining algorithm and the back propagation network algorithm.

  • PDF

A Coordinated Collaboration Method of Multiagent Systems based on Genetic Algorithms (유전알고리즘 기반의 멀티에이전트 시스템 조정 협동 기법)

  • Sohn, Bong-Ki;Lee, Keon-Myung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.2
    • /
    • pp.156-163
    • /
    • 2004
  • This paper is concerned with coordinated collaboration of multiagent system in which there exist multiple agents which have their own set of skills to perform some tasks, multiple external resources which can be either used exclusively by an agent or shared by the specified number of agents at a time, and a set of tasks which consists of a collection of subtasks each of which can be carried out by an agent. Even though a subtask can be carried out by several agents, its processing cost may be different depending on which agent performs it. To process tasks, some coordination work is required such as allocating their constituent subtasks among competent agents and scheduling the allocated subtasks to determine their processing order at each agent. This paper proposes a genetic algorithm-based method to coordinate the agents to process tasks in the considered multiagent environments. It also presents some experiment results for the proposed method and shows that the proposed method is a useful coordination collaboration method of multiagent system.

Development of Manufacturing Planning for Multi Modular Construction Project based on Genetic-Algorithm (유전자 알고리즘 기반 다중 모듈러 건축 프로젝트 수행 시 모듈러 유닛 공장생산계획수립 모델 개발)

  • Kim, Minjung;Park, Moonseo;Lee, Hyun-soo;Lee, Jeonghoon;Lee, Kwang-Pyo
    • Korean Journal of Construction Engineering and Management
    • /
    • v.16 no.5
    • /
    • pp.54-64
    • /
    • 2015
  • The modular construction has several advantages such as high quality of product, safe work condition and short construction duration. The manufacturing planning of modular construction should consider time frame of manufacturing, transport and erection process with limited resources (e.g., modular units, transporter and workers). The manufacturing planning of multi modular construction project manages the modular construction's characteristics and diversity of projects, as a type of modular unit, modular unit quantities, and date for delivery. However, current modular manufacturing planning techniques are weak in dealing with resource interactions and each project requirement in multi modular construction project environments. Inefficient allocation of resources during multi modular construction project may cause delays and cost overruns to construction operation. In this circumstance, this research suggest a manufacturing planning model for schedule optimization of multi project of modular construction, using genetic algorithm as one of the powerful method for schedule optimization with multiple constrained resources. Comparing to the result of the existed schedule of case study, setting optimized scheduling for multi project decrease the total factory producing schedule. By using proposed optimization tool, efficient allocation of resource and saving project time is expected.

Effective Scheduling Algorithm using Queue Separation and Packet Segmentation for Jumbo Packets (큐 분리 및 패킷 분할을 이용한 효율적인 점보패킷 스케쥴링 방법)

  • 윤빈영;고남석;김환우
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9A
    • /
    • pp.663-668
    • /
    • 2003
  • With the advent of high speed networking technology, computers connected to the high-speed networks tend to consume more of their CPU cycles to process data. So one of the solutions to improve the performance of the computers is to reduce the CPU cycles for processing the data. As the consumption of the CPU cycles is increased in proportion to the number of the packets per second to be processed, reducing the number of the packets per second by increasing the length of the packet is one of the solutions. In order to meet this requirement, two types of jumbo packets such as jumbograms and jumbo frames have already been standardized or being discussed. In case that the jumbograms and general packets are interleaved and scheduled together in a router, the jumbogrms may deteriorate the QoS of the general packets due to the transfer delay. They also frequently exhaust the memory with storing the huge length of the packets. This produces the congestion state easily in the router that results in the loss of the packets. In this paper, we analyze the problems in processing the jumbo packets and suggest a noble solution to overcome the problems.