• Title/Summary/Keyword: 프레임 스케줄링

Search Result 105, Processing Time 0.034 seconds

Performance of ARQ-aided Downlink Time Switched Transmit Diversity with multi-level Control Signaling in the WCDMA LCR-TDD System (WCDMA LCR-TDD 시스템에서 다중 레벨 제어 시그날링이 적용된 ARQ 기반 하향링크 TSTD의 성능)

  • Jeon, Cha-Eul;Hwang, Seung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.12
    • /
    • pp.61-68
    • /
    • 2010
  • In this paper, we investigate the performance of ARQ-aided Time Switched Transmit Diversity (ARQ-TSTD) applying the multi-level control signaling in the WCDMA LCR-TDD system. Proposed ARQ-TSTD system applies the multi-level control signaling scheme in which the receiver sends the response signal (ACK or NACK signal) to the transmitter and defines NACK2 signal for multi-level control. Transmitter utilize the NACK2 control signal to the postponement of transmission and multi-user scheduling scheme proposed by this paper. Simulation results demonstrate that the proposed postponement of transmission and multi-user scheduling scheme yield about 1.3dB, 1.4dB performance gain respectively, compared with the conventional ARQ-TSTD with antenna switching scheme in tenn of the frame error rate (FER) for mobile speed of 3km/h and FER value of 10%. In addition, 14% and 11.5% of throughput gain respectively is shown when Eb/N0=-3dB.

A Wireless Downlink Packet Scheduling Algorithm for Multimedia Traffic (멀티미디어 트래픽에 대한 무선 환경에서의 순방향 패킷 스케줄링 알고리즘)

  • 김동회;류병한
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.12
    • /
    • pp.539-546
    • /
    • 2002
  • In this paper, we consider a wireless multimedia environment to service both real-time video traffic and non-real-time WWW-application traffic In our suggested new packet scheduling algorithm, we consider both the accumulation counter and SIR to reduce delay in real-time traffic. In addition, our packet scheduling algorithm gives priority first to real-time video traffic service and then to non-real-time internet Packet service when real-time traffic service is absent. From the simulation results, we find that the AC (Accumulation Counter) scheme has much smaller delay than the conversional M-LWDF scheme for real-time video data users, which has a special quality sensitive to its own delay. We also consider the transmission structure of using both the frame period in the time-axis and the OVSF codes in the code-axis at the same time, which is similar to the structure of HSDPA system.

Scheduling Scheme and Performance Analysis of IEEE802.15.4e TSCH (IEEE802.15.4e TSCH의 스케줄링 방식 및 성능분석)

  • Park, Mi-Ryong;Kim, Dongwon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.5
    • /
    • pp.43-49
    • /
    • 2017
  • In this paper, we propose the scheduling scheme of IEEE802.15.4e TSCH which is not specified in standard specification. The proposed scheme schedules the link by cooperating among the devices. A new device scans EBs(Enhanced Beacons) from network. An advertiser device broadcasts an enhanced beacon frame including links information on allocated channel offset and time-slots, and a new device can determine its own channel offset and time-slot. It's performance on maximum throughput and minimum delay is evaluated by comparing the proposed approach with a typical single channel IEEE802.15.4.

Cell Scheduling Algorithm for Internet Service over ATM Networks (ATM 망에서 인터넷 서비스를 위한 셀 스케줄링 알고리즘)

  • Cho, Hae-Seong
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.12
    • /
    • pp.238-244
    • /
    • 2007
  • Guaranteed Frame Rate(GFR), recently approved by the ATM Forum, expects to become an important service category to efficiently support TCP/IP traffic in ATM networks. The GFR service not only guarantees a minimum service rate at the frame level, but also supports a fair share of available bandwidth. We proposed new scheduling scheme for the GFR service. Proposed scheme provides priority to VCs and high priority to a VC which have more untagged cells in buffer. High priority VCs have much more serviced than low priority. Proposed scheme can provide MCR(minimum cell rate) guarantee and fair sharing to GFR VCs. Computer simulation results show that proposed scheduling scheme provide a much better performance in TCP goodput and fairness than previous scheme.

Design and Development of Simulation Framework for Processing Window Query in Wireless Spatial Data Broadcasting Environment (무선 공간 데이터 방송 환경에서 범위 질의 처리를 위한 시뮬레이션 프레임워크의 설계와 구현)

  • Im, Seokjin;Hwang, Hee-Joung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.5
    • /
    • pp.173-178
    • /
    • 2014
  • Smart devices linked to high speed networks enable us to obtain location dependent data at anywhere and anytime. In this environment, a wireless data broadcast system can deal with enormous data request from a great number of clients effectively. In order to set up an efficient wireless data broadcast system, various data scheduling and indexing schemes have been proposed. However, a simulation framework to evaluate the schemes is not reported yet. In this paper, we design and develop a simulation framework for a wireless data broadcast system. The developed simulation framework can evaluate quickly a wireless data broadcast system and has scalability to adopt various data scheduling and indexing schemes for wireless data broadcasting.

The Design & Implementation of Fieldbus Bridge for Integration of different Fieldbus networks (이기종 필드버스 통합을 위한 필드버스 게이트웨이 설계 및 구현)

  • Lee, Yeong-Min;Kim, Myung-Kyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.116-120
    • /
    • 2011
  • In this paper, we have designed and implemented the integrated protocol gateway for the integration of CAN and Profibus networks. To do that, we used the Switched Ethernet as Backbone network, and each fieldbus network is connected by CAN/Ethernet or Profibus/Ethernet gateway, and each gateway perform the translation between fieldbus and Ethernet frames. Futhermore, we realized the real-time features in the environment of the Switched Ethernet by applying the distributed hard real-time scheduling algorithm among each gateways. To implement tht CAN/Ethernet and Profibus/Ethernet gateways, we used the Linux of kernel 2.6.31.12 real-time patched version(PREEMTED_RT), and we could verify successful message translation and real-time features through real implementation.

  • PDF

A design of GPU container co-execution framework measuring interference among applications (GPU 컨테이너 동시 실행에 따른 응용의 간섭 측정 프레임워크 설계)

  • Kim, Sejin;Kim, Yoonhee
    • KNOM Review
    • /
    • v.23 no.1
    • /
    • pp.43-50
    • /
    • 2020
  • As General Purpose Graphics Processing Unit (GPGPU) recently plays an essential role in high-performance computing, several cloud service providers offer GPU service. Most cluster orchestration platforms in a cloud environment using containers allocate the integer number of GPU to jobs and do not allow a node shared with other jobs. In this case, resource utilization of a GPU node might be low if a job does not intensively require either many cores or large size of memory in GPU. GPU virtualization brings opportunities to realize kernel concurrency and share resources. However, performance may vary depending on characteristics of applications running concurrently and interference among them due to resource contention on a node. This paper proposes GPU container co-execution framework with multiple server creation and execution based on Kubernetes, container orchestration platform for measuring interference which may be occurred by sharing GPU resources. Performance changes according to scheduling policies were investigated by executing several jobs on GPU. The result shows that optimal scheduling is not possible only considering GPU memory and computing resource usage. Interference caused by co-execution among applications is measured using the framework.

A New Bandwidth Allocation Scheme for Hard Real-time Communication on Dual IEEE 802.11 WLANs (이중 IEEE 802.11 WLAN에서 경성 실시간 통신을 위한 대역폭 할당)

  • Lee, Jung-Hoon;Kang, Mi-Kyung
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.5
    • /
    • pp.633-640
    • /
    • 2005
  • This paper proposes and analyzes a message scheduling scheme and corresponding bandwidth allocation method for the hard real-time communication on dual standard 802.11 Wireless LANs. By making the superframeof one network precede that of the other by half, the dual network architecture can minimize the effect of deferred beacon and reduce the worst case waiting timeby half. The effect of deferred beacon is formalized and directly considered to decide the polling schedule of PCF phase. Simulation results executed via ns-2 show that the proposed scheme can improve the schedulability by 3$36\%$ for real-time messages and give $9\%$ more bandwidth to non-real-time messages for the given stream sets, compared with the network whose bandwidth is just doubled with the same MAC.

The Implementation of Real-Time CORBA Event Services Using Java (자바를 이용한 실시간 CORBA 이벤트 서비스의 구현)

  • Gu, Tae-Wan;Kang, Seok-Tae;Jung, Yeon-Jin;Lee, Kwang-Mo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.04a
    • /
    • pp.251-254
    • /
    • 2001
  • 대표적인 분산 객체 환경을 위한 프레임 웍으로 1990년대 초 OMG(Object Management Group)에서 발표한 CORBA(Common Object Request Broker Architecture)를 들 수 있다. 이것은 분산, 이기종 환경에서 객체기반 응용 프로그램들의 재사용성(reusability), 이식성, 상호 운용성(interoperability)을 위한 공통 프레임 ???p이다. 하지만 표준 CORBA는 실시간 응용 프로그램 지원을 위한 한계점을 내재하고 있으므로 이를 그대로 적용하기에는 적합하지 않다. 때문에 RT-SIG(Real-Time Interest Special Croup)에서는 실시간 어플리케이션을 지원하기 위한 일련의 작업이 이루어 졌고, 그 산물로는 TAO(The Ace Orb)와 NraD(US Navy Research and Development), lona 사의 Orbix ORB, Lockheed Martin 사에서 개발한 CORBA 등이 있다. 하지만 표준 CORBA 명세서에 따르면 COS(CORBA Object Service)중의 하나인 이벤트 서비스는 실시간 응용프로그램을 지원하기 위해 필요한 실시간 디스패칭과 스케줄링의 보장, 중앙 집중화된 이벤트 필터링과 상관성을 위한 명시, 주기적 처리 지원 등의 기능이 결여되어 있기 때문에 이를 지원하는 실시간 이벤트 서비스가 요구된다. 이러한 요구에 부합하기 위해 필요한 요구사항을 자바 API 형태로 구현하고 향후 성능에 대한 개선 방향을 제시한다.

  • PDF

KOINONIA High-Rate WPAN Channel Time Allocation and CAC Algorithm for Multimedia Transmission (KOINONIA 고속 WPAN의 멀티미디어 전송을 위한 채널 타임 할당 및 CAC 알고리즘)

  • Park Jong-Ho;Lee Tae-Jin;June Sun-Do;Youn Kyu-Jung;Won Yun-Jae;Cho Jin-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5A
    • /
    • pp.417-425
    • /
    • 2005
  • KOINONIA is high-rate Wireless Personal Area Network (WPAN) technology, and is developed for multimedia traffic transmission in personal area. A KOINONIA piconet is a collection of one or more associated slaves under a single master. Efficient scheduling of a master for the traffic of slaves is essential to use channel effectively and to guarantee QoS of multimedia traffic. We propose a new scheduling algorithm to allocate channel time at desired intervals regardless of superframe length, and a Connection Admission Control(CAC) algorithm to regulate the number of traffics in a piconet. Our proposed algorithms have been shown to save channel time and to meet QoS requirements compared to the conventional weighted round-robin algorithm.