• Title/Summary/Keyword: context switching

Search Result 82, Processing Time 0.022 seconds

Choice Satisfaction of the Broadband Internet Network Services (초고속 인터넷 서비스의 선택 만족도에 대한 연구)

  • Kang, Hyun-Mo;Bang, Joung-Hae;Lee, Eun-Hyung
    • The Journal of Society for e-Business Studies
    • /
    • v.16 no.3
    • /
    • pp.47-66
    • /
    • 2011
  • This study empirically investigates the antecedents and outcomes of choice satisfaction in the context of choosing and using the broadband Internet network services. Hypotheses are tested with regression models analyzing a survey data of 481 consumers of the broadband Internet network services in Korea. Our results show that choice satisfaction is affected by choice contexts while service satisfaction is not. Choice satisfaction is as important as service satisfaction for formation of switching intentions whereas it is less important for formation of recommendation intentions. Also, consumers characteristics are reported for those whose service satisfaction and choice satisfaction are not consistent. Choice satisfaction is a distinctive concept different from service satisfaction. Marketers can make consumers more satisfied not only managing delivery of services but also by managing their choice contexts. That will increase the loyalty of their consumers. This study finds unique determinants of choice satisfaction. Further studies are needed to clarify boundary conditions regarding the effects of choice contexts on choice satisfaction.

A Control of the ZVZCS PS-FB DC/DC Converter using All-Pass Filter (전역통과필터를 이용한 ZVZCS PS-FB DC/DC 컨버터의 제어)

  • Cho, Han-Jin;Lee, Won-Cheol;Lee, Sang-Seok;Lee, Su-Won;Won, Chung-Yuen
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.24 no.1
    • /
    • pp.152-159
    • /
    • 2010
  • High power density and power conversion efficiency have been required in the power converters according to the rapid growth of industry. In this context, the next generation High Speed Train(HST) requires power converter which has high-efficiency, high-performance and high-density. In this paper, the new control technique for battery charger used for the next generation HST is proposed. The phase shift ZVZCS converter is classified according to a resonant circuit which is located in the primary or secondary side. In this paper, The PWM switching technique using all-pass filter is proposed to control ZVZCS converter which has resonant circuit in the secondary side. ATmega_128 micro controller based in all-pass filter in substitute for phase shift IC is presented to have digital control. To verify the proposed topology, the simulation and experiment are performed by using PSIM software and 1[kW] experimental set-up.

A Scheduling Algorithm for Continuous Media (연속미디어를 위한 스케쥴링 알고리즘)

  • 유명련;안병철
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.5
    • /
    • pp.371-376
    • /
    • 2001
  • Since continuous media such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms cold be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm based on the stride scheduler is a scheduling algorithm considered the time constraint of the continuous media. The stride schedulers, which are designed to general tasks, guarantee the fairness of resource allocation and predictability. The key concept of RRPSSA is a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness which is a strong point of the stride schedulers, and does not show graceful degradation of performance under overloaded situation. This paper proposes a new modified algorithm, namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and it reduces the scheduling violations up to 70% by maintaining the fair resource allocation. The number of context switching is 8% less than RRPSSA and the overall performance is increased.

  • PDF

A Tool to Support Personal Software Process (개인 소프트웨어 프로세스 지원을 위한 도구)

  • Shin, Hyun-Il;Jung, Kyoung-Hak;Song, Il-Sun;Choi, Ho-Jin;Baik, Jong-Moon
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.8
    • /
    • pp.752-762
    • /
    • 2007
  • The PSP (Personal Software Process) is developed to help developers make high-quality products through improving their personal process. With consistent measurement and analysis activity that the PSP suggests, developers can identify process deficiencies and make reliable estimates on effort and quality. However, due to the high-overhead and context-switching problem of manual data recording, developers have difficulties in collecting reliable data, which can lead wrong analysis results. On the other hand, the paper-based process guides of the PSP are inconvenient to navigate its process information and difficult to attach additional information. In this paper, we introduce a PSP supporting tool developed to handle these problems. The tool provides automated data collection facilities to help acquire reliable data, an EPG (Electronic Process Guide) for the PSP to provide easy access and navigation of the process information, and an experience repository to store development experience as additional information about the process.

A Modified Proportional Scheduler and Evaluation Method (수정 비례 지분 스케쥴러 및 평가법 설계)

  • 김현철;박정석
    • Journal of Internet Computing and Services
    • /
    • v.3 no.2
    • /
    • pp.15-26
    • /
    • 2002
  • Since multimedia data such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms could net be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm is a scheduling algorithm considered the time constraint of the multimedia data. This scheduling algorithm uses a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness, and does not show graceful degradation of performance under overloaded situation, This paper proposes a new modified algorithm. namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency, Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and the reduction in the number of context switching, Furthermore, a new evaluation method is proposed which can evaluate the flexibility of scheduling algorithm.

  • PDF

A Scheduler for Multimedia Data and Evaluation Method (멀티미디어 데이터를 위한 스케쥴러 및 평가법 설계)

  • 유명련;김현철
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.2
    • /
    • pp.1-7
    • /
    • 2002
  • Since multimedia data such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms could not be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm is a scheduling algorithm considered the time constraint of the multimedia data. This scheduling algorithm uses a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness, and does not show graceful degradation of performance under overloaded situation. This paper proposes a new modified algorithm, namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and the reduction in the number of context switching. Furthermore, a new evaluation method is proposed which can evaluate the flexibility of scheduling algorithm.

  • PDF

The Design and Implementation of the Multimedia End-to-End Server I/O System based on Linux (멀티미디어 End-to-End 서버용 리눅스 기반 I/O 시스템 설계 및 구현)

  • Nam, Sang-Jun;Lee, Byeong-Rae;Park, Nam-Seop;Lee, Yun-Jeong;Kim, Tae-Yun
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.311-318
    • /
    • 2001
  • In recent years, users\` demands for multimedia service are increasing because of a diffusion of internet. Server systems, however, offer inefficient multimedia data service to users. Multimedia applications often transfer the same data between shared devices at very high rates, and therefore require an efficient I/O subsystem. Data copying and context switching have long been identified as sources of I/O inefficiency. Therefore we propose the new Multimedia Stream System Call (MSSC) mechanism, which is inserted into a Linux kernel: The MSSC mechanism operates in kernel domain with RTP (Real-time Transport Protocol). We present measurements indicating that use of our techniques resulted in a 12.5%∼14% gain in throughput as compared with a conventional Linux system.

  • PDF

Design of Multiprocess Models for Parallel Protocol Implementation (병렬 프로토콜 구현을 위한 다중 프로세스 모델의 설계)

  • Choi, Sun-Wan;Chung, Kwang-Sue
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2544-2552
    • /
    • 1997
  • This paper presents three multiprocess models for parallel protocol implementation, that is, (1)channel communication model, (2)fork-join model, and (3)event polling model. For the specification of parallelism for each model, a parallel programming language, Par. C System, is used. to measure the performance of multiprocess models, we implemented the Internet Protocol Suite(IPS) Internet Protocol (IP) for each model by writing the parallel language on the Transputer. After decomposing the IP functions into two parts, that is, the sending side and the receiving side, the parallelism in both sides is exploited in the form of Multiple Instruction Single Data (MISD). Three models are evaluated and compared on the basis of various run-time overheads, such as an event sending via channels in the parallel channel communication model, process creating in the fork-join model and context switching in the event polling model, at the sending side and the receiving side. The event polling model has lower processing delays as about 77% and 9% in comparison with the channel communication model and the fork-join model at the sending side, respectively. At the receiving side, the fork-join model has lower processing delays as about 55% and 107% in comparison with the channel communication model and the event polling model, respectively.

  • PDF

A Study on the Application of Zero Copy Technology to Improve the Transmission Efficiency and Recording Performance of Massive Data (대용량 데이터의 전송 효율 및 기록 성능 향상을 위한 Zero Copy 기술 적용에 관한 연구)

  • Song, Min-Gyu;Kim, Hyo-Ryoung;Kang, Yong-Woo;Je, Do-Heung;Wi, Seog-Oh;Lee, Sung-Mo;Kim, Seung-Rae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.6
    • /
    • pp.1133-1144
    • /
    • 2021
  • Zero-copy is a technology that is also called no-memory copy, and through its use, context switching between the user space and the kernel space can be reduced to minimize the load on the CPU. However, this technology is only used to transmit small random files, and has not yet been widely used for large file transfers. This paper intends to discuss the practical application of zero-copy in processing large files via a network. To this end, we first developed a small test bed and program that can transmit and store data based on zero-copy. Afterwards, we intend to verify the usefulness of the applied technology in detail through detailed performance evaluation

An interactive teachable agent system for EFL learners (대화형 Teachable Agent를 이용한 영어말하기학습 시스템)

  • Kyung A Lee;Sun-Bum Lim
    • The Journal of the Convergence on Culture Technology
    • /
    • v.9 no.3
    • /
    • pp.797-802
    • /
    • 2023
  • In an environment where English is a foreign language, English learners can use AI voice chatbots in English-speaking practice activities to enhance their speaking motivation, provide opportunities for communication practice, and improve their English speaking ability. In this study, we propose a teaching-style AI voice chatbot that can be easily utilized by lower elementary school students and enhance their learning. To apply the Teachable Agent system to language learning, which is an activity based on tense, context, and memory, we proposed a new method of TA by applying the Teachable Agent to reflect the learner's English pronunciation and level and generate the agent's answers according to the learner's errors and implemented a Teachable Agent AI chatbot prototype. We conducted usability evaluations with actual elementary English teachers and elementary school students to demonstrate learning effects. The results of this study can be applied to motivate students who are not interested in learning or elementary school students to voluntarily participate in learning through role-switching.