• Title/Summary/Keyword: time sharing control

Search Result 246, Processing Time 0.026 seconds

Predictive Traffic Control Scheme of ABR Service (ABR 서비스를 위한 예측 트래픽 제어모델)

  • 오창윤;임동주;배상현
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.2
    • /
    • pp.307-312
    • /
    • 2000
  • Asynchronous transfer mode(ATM) is flexible to support the various multimedia communication services such as data, voice, and image by applying asynchronous time-sharing and statistical multiplexing techniques to the existing data communication. ATM service is categorized to CBR, VBR, UBR, and ABR according to characteristics of the traffic and a required service qualities. Among them, ABR service guarantees a minimal bandwidth and can transmit cells at a maximum transmission rate within the available bandwidth. To minimize the cell losses in transmission and switching, a feedback information in ATM network is used to control the traffic. In this paper, predictive control algorithms are proposed for the feedback information. When the feedback information takes a long propagation delay to the backward nodes, ATM switch can experience a congestion situation from the queue length increases, and a high queue length fluctuations in time. The control algorithms proposed in this paper provides predictive control model using slop changes of the queue length function and previous data of the queue lengths. Simulation shows the effectiveness result of the proposed control algorithms.

  • PDF

A Dynamic Resource Allocation scheme with a GPS algorithm in Cellular-based Hybrid and Distributed Wireless Multi-hop Systems (셀룰라 기반의 하이브리드 분산식 멀티홉 시스템에서의 GPS 알고리즘을 이용한 동적 자원할당 기법)

  • Bae, Byung-Joo;Kim, Dong-Kun;Shin, Bong-Jhin;Kang, Byoung-Ik;Hong, Dae-Hyoung;Choe, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11A
    • /
    • pp.1120-1127
    • /
    • 2007
  • In this paper, we propose a generalized processor sharing - dynamic resource allocation (GPS-DRA) scheme which allocates the required amount of resources to each hop dynamically in cellular-based multi-hop systems. In the hybrid-distributed system considered in this paper, a central controller such as a base station (BS) should allocate resources properly to each hop. However, due to changing channel condition with time, it is difficult to allocate as much amount of resources as each hop needs for transmission. GPS-DRA scheme allocates the required amount of resources dynamically to each hop based on the amount of resources used in previous frames by each hop. The amount of control overhead generated by GPS-DRA scheme can be very small because a central controller doesn't need to collect all link information for resource allocation. Our simulation results show that channel utilization increased about 16% and cell capacity increased about 65% compared to those of fixed resource allocation (FRA) scheme.

Radio Resource Sharing using Power Control of Base-station in Cognitive Radio System (코그니티브 라디오 시스템에서의 전력 제어를 이용한 무선 자원 공유)

  • Kwon, Yang-Soo;Ji, Young-Geun;Chung, Jae-Hak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.1057-1064
    • /
    • 2007
  • Cognitive radio(CR) technique which utilizes empty frequency bands allocated to private business but not being used temporally has been researched. According to the standard, CR users detect the primary user using the same channel, CR users should move to the another channel to guarantee the primary user's decodability. Thus, CR systems cannot use the same channel and support the CR user's QoS(Quality of Service) during the channel moving time. In this paper, we propose a radio resource sharing method that CR basestation controls the transmission power with the primary user's SNR(Signal to Noise Ratio) to increase the spectral efficiency of area and to minimize the outage of CR users. In addition, computer simulation demonstrates show that the proposed method improved spectral efficiency of area and decreased outage probability of CR users.

Adjusting Local Network Speed by Using Fuzzy Theory with An Illustration in WebRTC Environment (퍼지이론과 예증을 이용한 WebRTC환경의 로컬 네트워크 속도 조정)

  • Van, Linh Ma;Jang, Jong-hyun;Kim, Jinsul
    • Journal of Digital Contents Society
    • /
    • v.16 no.6
    • /
    • pp.917-925
    • /
    • 2015
  • WebRTC is one of the most recent technologies that supports browser-to-browser for voice calling, video chat, and P2P file sharing without the need of either internal or external plugins. However, there has some limitation which lets our development deal with many problems. This research will focus just on a small field of that problem which is bandwidth. While the bandwidth for downloading and uploading is fixed by service providers, but the number of users in a certain area is increasing largely by the time. In this paper, we propose a model to overcome the limitation of the bandwidth based on fuzzy control to adjust utilized bandwidth by changing frame rate and resolution of streaming video in the client itself.

Performance Improvement of Parallel Processing System through Runtime Adaptation (실행시간 적응에 의한 병렬처리시스템의 성능개선)

  • Park, Dae-Yeon;Han, Jae-Seon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.7
    • /
    • pp.752-765
    • /
    • 1999
  • 대부분 병렬처리 시스템에서 성능 파라미터는 복잡하고 프로그램의 수행 시 예견할 수 없게 변하기 때문에 컴파일러가 프로그램 수행에 대한 최적의 성능 파라미터들을 컴파일 시에 결정하기가 힘들다. 본 논문은 병렬 처리 시스템의 프로그램 수행 시, 변화하는 시스템 성능 상태에 따라 전체 성능이 최적화로 적응하는 적응 수행 방식을 제안한다. 본 논문에서는 이 적응 수행 방식 중에 적응 프로그램 수행을 위한 이론적인 방법론 및 구현 방법에 대해 제안하고 적응 제어 수행을 위해 프로그램의 데이타 공유 단위에 대한 적응방식(적응 입도 방식)을 사용한다. 적응 프로그램 수행 방식은 프로그램 수행 시 하드웨어와 컴파일러의 도움으로 프로그램 자신이 최적의 성능을 얻을 수 있도록 적응하는 방식이다. 적응 제어 수행을 위해 수행 시에 병렬 분산 공유 메모리 시스템에서 프로세서 간 공유될 수 있은 데이타의 공유 상태에 따라 공유 데이타의 크기를 변화시키는 적응 입도 방식을 적용했다. 적응 입도 방식은 기존의 공유 메모리 시스템의 공유 데이타 단위의 통신 방식에 대단위 데이타의 전송 방식을 사용자의 입장에 투명하게 통합한 방식이다. 시뮬레이션 결과에 의하면 적응 입도 방식에 의해서 하드웨어 분산 공유 메모리 시스템보다 43%까지 성능이 개선되었다. Abstract On parallel machines, in which performance parameters change dynamically in complex and unpredictable ways, it is difficult for compilers to predict the optimal values of the parameters at compile time. Furthermore, these optimal values may change as the program executes. This paper addresses this problem by proposing adaptive execution that makes the program or control execution adapt in response to changes in machine conditions. Adaptive program execution makes it possible for programs to adapt themselves through the collaboration of the hardware and the compiler. For adaptive control execution, we applied the adaptive scheme to the granularity of sharing adaptive granularity. Adaptive granularity is a communication scheme that effectively and transparently integrates bulk transfer into the shared memory paradigm, with a varying granularity depending on the sharing behavior. Simulation results show that adaptive granularity improves performance up to 43% over the hardware implementation of distributed shared memory systems.

A Study on the Expanded R/R Scheduling in Priority-based $\mu{C/OS-II}$ Kernel (우선순위 기반의 $\mu{C/OS-II}$ 커널에서 확장된 R/R 스케줄링 연구)

  • 김태호;김창수
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.3
    • /
    • pp.323-330
    • /
    • 2002
  • Recently, the existing embedded real-time operating systems(RTOSs) are being developed in terms of various modified versions in every application fields. Major characteristics and difference of these OSs lie in their distinct development of mechanisms which can be used in various environment and task-scheduling function which can control time-limited contingencies. In this paper, we design and implement round/robin scheduling algorithm based on time-sharing with equal-priority for multiple tasks which are provided preemptive and priority task allocation function in $\mu{C/OS-II}$ version 2.03. We propose the most important event-ready list structure in $\mu{C/OS-II}$; kernel, and provide the running result for multiple tasks with equal priority for the proposed structure.

  • PDF

Design of Graphic Memory for QVGA-Scale LCD Driver IC (QVGA급 LCD Driver IC의 그래픽 메모리 설계)

  • Kim, Hak-Yun;Cha, Sang-Rok;Lee, Bo-Sun;Jeong, Yong-Cheol;Choi, Ho-Yong
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.12
    • /
    • pp.31-38
    • /
    • 2010
  • This paper presents the design of a graphic memory for QVGA-scale LCD Driver IC (LDI). The graphic memory is designed based on the pseudo-SHAM for the purpose of small area, and the memory cell structure is designed using a bit line partitioning method to improve sensing characteristics and drivabilties in the line-read operation. Also, a collision protection circuit using C-gate is designed to control collisions between read/write operations and self-refresh/line-read operations effectively. The graphic memory circuit has been designed in transistor level using $0.18{\mu}m$ CMOS technology library and the operations of the graphic memory have been verified using Hspice. The results show that the bit-bitb line voltage difference, ${\Delta}V$ increases by 40%, the charge sharing time between bit and bitb voltages $T_{CHGSH}$ decreases by 30%, and the current during line-read decreases by 40%.

Distributed CSMA/CA Medium Access Control for Incomplete Medium Sharing Systems with General Channel Access Constraints (불완전매체공유 환경을 위한 CSMA/CA기반 분산방식 매체접근제어기법)

  • Lee Byoung-Seok;Jeon Byoung-Wook;Choe Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.365-377
    • /
    • 2006
  • We define the incomplete medium sharing system as a multi-channel shared medium communication system where any types of constraints are imposed to the set of channels that may be allocated to any transmitter-receiver node pair. A set of distributed MAC schemes are proposed, all of which are based on the CSMA/CA scheme employed in IEEE 802. 11 WLAN standards. Distributed MAC schemes are proposed in three different forms, which can be differentiated by the number and the location of back-off timers; that is, (1) one timer for all queues destined for different receiver nodes, (2) multiple timers at individual transmission queues, (3) multiple timers for individual channels. Through an extensive set of computer simulations, the performances of the proposed MAC schemes show that the MAC scheme with timers at individual transmission queues outperform the others in terms of throughput and delay for most cases considered. The complexity of the proposed schemes is also compared, and the first scheme obviously turned out to be the simplest, and the complexity of the second and third schemes depends on the number of receiver nodes and the number of channels, respectively.

Design of intelligent Traffic Control System using Multiprocessor Architecture (멀티 프로세서 구조를 이용한 지능형 교통신호 제어시스템 설계)

  • 한경호;정길도
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.12 no.2
    • /
    • pp.62-68
    • /
    • 1998
  • In this paper, we proposed the design of the intelligent traffic control system by using multiprocessor architecture. The inter-processor communication of the architecture is implemented by sharing the serial communication channel. In comparing the conventional traffic control system using single processor architecture, the proposed system uses multiple processors controlling the sub systems such as the signal lights, traffic measurement unit, auxiliary signal lights and peripherals. The main processor controls the communication among the processors and the communication protocol link to the central control center at remote site. The proposed architecture reduces the load and simplifies the program of each processor and enables the real time processing of the add-on features of intelligent traffic control systems. The architecture is implemented and the common channel inter-processor communications and the real time operation is experimented .experimented .

  • PDF

Pareto Ratio and Inequality Level of Knowledge Sharing in Virtual Knowledge Collaboration: Analysis of Behaviors on Wikipedia (지식 공유의 파레토 비율 및 불평등 정도와 가상 지식 협업: 위키피디아 행위 데이터 분석)

  • Park, Hyun-Jung;Shin, Kyung-Shik
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.3
    • /
    • pp.19-43
    • /
    • 2014
  • The Pareto principle, also known as the 80-20 rule, states that roughly 80% of the effects come from 20% of the causes for many events including natural phenomena. It has been recognized as a golden rule in business with a wide application of such discovery like 20 percent of customers resulting in 80 percent of total sales. On the other hand, the Long Tail theory, pointing out that "the trivial many" produces more value than "the vital few," has gained popularity in recent times with a tremendous reduction of distribution and inventory costs through the development of ICT(Information and Communication Technology). This study started with a view to illuminating how these two primary business paradigms-Pareto principle and Long Tail theory-relates to the success of virtual knowledge collaboration. The importance of virtual knowledge collaboration is soaring in this era of globalization and virtualization transcending geographical and temporal constraints. Many previous studies on knowledge sharing have focused on the factors to affect knowledge sharing, seeking to boost individual knowledge sharing and resolve the social dilemma caused from the fact that rational individuals are likely to rather consume than contribute knowledge. Knowledge collaboration can be defined as the creation of knowledge by not only sharing knowledge, but also by transforming and integrating such knowledge. In this perspective of knowledge collaboration, the relative distribution of knowledge sharing among participants can count as much as the absolute amounts of individual knowledge sharing. In particular, whether the more contribution of the upper 20 percent of participants in knowledge sharing will enhance the efficiency of overall knowledge collaboration is an issue of interest. This study deals with the effect of this sort of knowledge sharing distribution on the efficiency of knowledge collaboration and is extended to reflect the work characteristics. All analyses were conducted based on actual data instead of self-reported questionnaire surveys. More specifically, we analyzed the collaborative behaviors of editors of 2,978 English Wikipedia featured articles, which are the best quality grade of articles in English Wikipedia. We adopted Pareto ratio, the ratio of the number of knowledge contribution of the upper 20 percent of participants to the total number of knowledge contribution made by the total participants of an article group, to examine the effect of Pareto principle. In addition, Gini coefficient, which represents the inequality of income among a group of people, was applied to reveal the effect of inequality of knowledge contribution. Hypotheses were set up based on the assumption that the higher ratio of knowledge contribution by more highly motivated participants will lead to the higher collaboration efficiency, but if the ratio gets too high, the collaboration efficiency will be exacerbated because overall informational diversity is threatened and knowledge contribution of less motivated participants is intimidated. Cox regression models were formulated for each of the focal variables-Pareto ratio and Gini coefficient-with seven control variables such as the number of editors involved in an article, the average time length between successive edits of an article, the number of sections a featured article has, etc. The dependent variable of the Cox models is the time spent from article initiation to promotion to the featured article level, indicating the efficiency of knowledge collaboration. To examine whether the effects of the focal variables vary depending on the characteristics of a group task, we classified 2,978 featured articles into two categories: Academic and Non-academic. Academic articles refer to at least one paper published at an SCI, SSCI, A&HCI, or SCIE journal. We assumed that academic articles are more complex, entail more information processing and problem solving, and thus require more skill variety and expertise. The analysis results indicate the followings; First, Pareto ratio and inequality of knowledge sharing relates in a curvilinear fashion to the collaboration efficiency in an online community, promoting it to an optimal point and undermining it thereafter. Second, the curvilinear effect of Pareto ratio and inequality of knowledge sharing on the collaboration efficiency is more sensitive with a more academic task in an online community.