• 제목/요약/키워드: end-to-end scheduling

검색결과 169건 처리시간 0.031초

IEEE 802.15.4e 멀티 채널 QoS 스케줄링 알고리즘 (Multi-channel QoS scheduling algorithm in IEEE 802.15.4e)

  • 우혁;김학규;이동준;강호용
    • 한국항행학회논문지
    • /
    • 제15권5호
    • /
    • pp.764-773
    • /
    • 2011
  • IEEE 802.15.4는 TDMA(time division multiple access) 방식으로 동작하는 LWPAN(low-rate wireless personal area networks)의 표준이다. 그러나 IEEE 802.15.4는 QoS(quality of service), 확장성, 신뢰성 등에 제약이 있다. 기존 IEEE 802.15.4에서는 QoS 지원을 위하여 GTS(guaranteed time slot)을 사용한다. 그러나 GTS는 멀티 홉 환경에서 다수의 장치들의 QoS를 만족시키기에 효과적인 방법이 아니며, 멀티 주파수 채널에 대한 고려도 없다. 이러한 제약 사항을 보완하기 위하여 IEEE 802.15.4의 MAC(medium access control) 부계층을 강화한 표준으로써 IEEE 802.15.4e가 개발 중이다. 본 논문에서는 IEEE 802.15.4e에서 멀티 채널, 멀티 홉 환경의 종단 장치간 전송 지연을 만족시키기 위한 스케줄링 방식을 제안하고, 시뮬레이터를 이용하여 성능 평가를 수행하였다.

Device to Device Communications Architectures and Cross-Layer Evaluation Frameworks

  • Aldabbagh, Ghadah
    • International Journal of Computer Science & Network Security
    • /
    • 제21권1호
    • /
    • pp.152-161
    • /
    • 2021
  • The paper focuses on Device-to-device (D2D) Architectures evaluation frameworks. D2D communication and discovery can improve spectrum usage efficiency and optimize the tradeoffs between throughput and energy consumption. The target operation modes involve both indirect communication between two nodes via a base station or the direct communication among proximal nodes, enabling use cases that can support communications out of cellular coverage, as well as low end-end delay requirements. The paper will present the architectural evolution of D2D networks within 3GPP standardization and will highlight key network functionalities and signaling protocols. It will also identify key analytical and simulation models that can be used to assess the performance and energy efficiency of resource allocation strategies, and it will present a suitable cross-layer integrated framework.

이종망에서 MPTCP를 위한 패킷 스케줄링 방법과 수신단 기반의 손실 복구 방법 (Packet Scheduling Scheme and Receiver-Based Recovery Scheme for MPTCP in Heterogeneous Networks)

  • 오봉환;김한아;이재용
    • 한국통신학회논문지
    • /
    • 제37B권11호
    • /
    • pp.975-983
    • /
    • 2012
  • 하나의 단말이 WiFi, 3G, LTE 등 다양한 통신 인터페이스들을 가지고 있는 것이 점점 일반화 되면서, 단말간의 통신에서 다수의 네트워크 경로를 동시에 이용하여 전숑 효율을 높이고자 하는 연구들이 진행되고 있다. MPTCP는 IETF에서 표준화가 진행되고 있는 transport layer protocol로서 서로 다른 IP 주소를 가지고 있는 여러 통신 인터페이스를 동시에 사용한 데이터 전송을 가능하게 한다. 하지만 현재의 MPTCP는 서로 다른 성질의 네트워크의 인터페이스를 동시에 사용하면 reordering 문제로 오히려 하나의 네트워크를 사용하는 것보다 성능이 저하되는 문제점을 가지고 있다. 따라서 본 논문은 MPTCP에서 통신 인터페이스의 네트워크 상태에 따른 패킷 스케줄링 방법과 수신단 기반의 패킷 손실 복구 방법을 제안함으로써 MPTCP에서 reordering 문제로 발생하는 성능 저하를 감소시켰다. 또한 제안된 방법은 기존의 방법보다 더 나은 throughput과 더 빠른 재전송을 수행 할 수 있음을 시뮬레이션을 통해 확인하였다.

Advanced Alignment-Based Scheduling with Varying Production Rates for Horizontal Construction Projects

  • Greg Duffy;Asregedew Woldesenbet;David Hyung Seok Jeong;Garold D. Oberlender
    • 국제학술발표논문집
    • /
    • The 5th International Conference on Construction Engineering and Project Management
    • /
    • pp.403-411
    • /
    • 2013
  • Horizontal construction projects such as oil and gas pipeline projects typically involve repetitive-work activities with the same crew and equipment from one end of the project to the other. Repetitive scheduling also known as linear scheduling is known to have superior schedule management capabilities specifically for such horizontal construction projects. This study discusses on expanding the capabilities of repetitive scheduling to account for the variance in production rates and visual representation by developing an automated alignment based linear scheduling program for applying temporal and spatial changes in production rates. The study outlines a framework to apply changes in productions rates when and where they will occur along the horizontal alignment of the project and illustrates the complexity of construction through the time-location chart through a new linear scheduling model, Linear Scheduling Model with Varying Production Rates (LSMVPR). The program uses empirically derived production rate equations with appropriate variables as an input at the appropriate time and location based on actual 750 mile natural gas liquids pipeline project starting in Wyoming and terminating in the center of Kansas. The study showed that the changes in production rates due to time and location resulted in a close approximation of the actual progress of work as compared to the planned progress and can be modeled for use in predicting future linear construction projects. LSMVPR allows the scheduler to develop schedule durations based on minimal project information. The model also allows the scheduler to analyze the impact of various routes or start dates for construction and the corresponding impact on the schedule. In addition, the graphical format lets the construction team to visualize the obstacles in the project when and where they occur due to a new feature called the Activity Performance Index (API). This index is used to shade the linear scheduling chart by time and location with the variation in color indicating the variance in predicted production rate from the desired production rate.

  • PDF

A Two-Stage Heuristic for Disassembly Scheduling with Capacity Constraints

  • Jeon Hyong-Bae;Kim Jun-Gyu;Kim Hwa-Joong;Lee Dong-Ho
    • Management Science and Financial Engineering
    • /
    • 제12권1호
    • /
    • pp.95-112
    • /
    • 2006
  • Disassembly scheduling is the problem of determining the quantity and timing of disassembling used or end-of-life products while satisfying the demand of their parts and/or components over a planning horizon. The case of assembly product structure is considered while the resource capacity constraints are explicitly considered. A cost-based objective is considered that minimizes the sum of disassembly operation and inventory holding costs. The problem is formulated as an integer programming model, and a two-stage heuristic with construction and improvement algorithms is suggested in this paper. To test the performance of the heuristic, computational experiments are done on randomly generated problems, and the results show that the heuristic gives near optimal solutions within a very short amount of computation time.

Disassembly Scheduling for Products with Assembly Structure

  • Lee Dong-Ho
    • Management Science and Financial Engineering
    • /
    • 제11권1호
    • /
    • pp.63-78
    • /
    • 2005
  • Disassembly scheduling is the problem of determining the ordering and disassembly schedules of used or end-of-life products while satisfying the demand of their parts or components over a certain planning horizon. This paper considers the case of the assembly product structure for the cost-based objective of minimizing the sum of purchase, setup, inventory holding, and disassembly operation costs. To represent and solve the problem optimally, this paper presents an integer programming model, which is a reversed form of the multi-level lot sizing formulation. Computational experiments on an example derived from the literature and a number of randomly generated test problems are done and the results are reported.

HeteroAccel: 엣지 컴퓨팅 환경에서의 다양한 영상 추론을 위한 쿠버네티스 기반의 이종 연산·가속기 자원 관리 시스템 (Kubernetes-based Heterogeneous Computational and Accelerator Resource Management System for Various Image Inferences in Edge Computing Environments)

  • 전재호;김용연;강성주
    • 대한임베디드공학회논문지
    • /
    • 제16권5호
    • /
    • pp.201-207
    • /
    • 2021
  • Edge Computing enables image-based inference in close proximity to end users and real-world objects. However, since edge servers have limited computational and accelerator resources, efficient resource management is essential. In this paper, we present HeteroAccel system that performs optimal scheduling in Kubernetes platform based on available node and accelerator information for various inference requests. Our experiments showed 25.3% improvement in overall inference performance over the default scheduling scheme in edge computing environment in which four types of inference services are requested.

Modeling of a storage subsystem in multimedia information system

  • Lim, Cheol-Su
    • 한국통신학회논문지
    • /
    • 제22권11호
    • /
    • pp.2521-2530
    • /
    • 1997
  • In this paepr, we present a video-on-demand (VOD) system design model that address and integrates a number of inter-related issues. Then with analysis and performance evaluation, we investigate various aspects of disk and buffer managements in the given model. Based on the analysis results, we suggest that a distributed buffering scheme with intermediate buffers may te useful to transform bursty disk accesses into a continuous stream for for glitch-free performance of VOD systems. Also, through simulation, we illustrate that massive multimedia information storage design techniques such as prefetching, clustered striping, and real-time disk scheduling integrated with the distributed buffering mechanism may enhance end-to-end real-time performance of VOD systems under wide-area networks.

  • PDF

볼엔드 밀링에서의 일정 절삭력을 위한 NURBS 곡면 인터폴레이터 (NURBS Surface Interpolator for Constant Cutting Forces in Ball-End Milling)

  • 지성철;구태훈
    • 대한기계학회논문집A
    • /
    • 제26권9호
    • /
    • pp.1888-1896
    • /
    • 2002
  • This study presents a new type of CNC interpolator that is capable of generating cutter paths for ball-end milling of NURBS surfaces. The proposed surface interpolator comprises real-time algorithms for cutter contact (CC) path scheduling and CC path interpolator. Especially in this study, a new interpolator module to regulate cutting forces is developed. This propose algorithm utilizes variable-feedrate commands along the CC path according to the curvature of machined surfaces during the interpolation process. Additionally, it proposes an OpenGL graphic library for computer graphics and animation of interpolated tool-position display. The proposed interpolator is evaluated and compared with the existing method based on constant feedrates through computer simulations.

Minimizing Energy Consumption in Scheduling of Dependent Tasks using Genetic Algorithm in Computational Grid

  • Kaiwartya, Omprakash;Prakash, Shiv;Abdullah, Abdul Hanan;Hassan, Ahmed Nazar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권8호
    • /
    • pp.2821-2839
    • /
    • 2015
  • Energy consumption by large computing systems has become an important research theme not only because the sources of energy are depleting fast but also due to the environmental concern. Computational grid is a huge distributed computing platform for the applications that require high end computing resources and consume enormous energy to facilitate execution of jobs. The organizations which are offering services for high end computation, are more cautious about energy consumption and taking utmost steps for saving energy. Therefore, this paper proposes a scheduling technique for Minimizing Energy consumption using Adapted Genetic Algorithm (MiE-AGA) for dependent tasks in Computational Grid (CG). In MiE-AGA, fitness function formulation for energy consumption has been mathematically formulated. An adapted genetic algorithm has been developed for minimizing energy consumption with appropriate modifications in each components of original genetic algorithm such as representation of chromosome, crossover, mutation and inversion operations. Pseudo code for MiE-AGA and its components has been developed with appropriate examples. MiE-AGA is simulated using Java based programs integrated with GridSim. Analysis of simulation results in terms of energy consumption, makespan and average utilization of resources clearly reveals that MiE-AGA effectively optimizes energy, makespan and average utilization of resources in CG. Comparative analysis of the optimization performance between MiE-AGA and the state-of-the-arts algorithms: EAMM, HEFT, Min-Min and Max-Min shows the effectiveness of the model.