• Title/Summary/Keyword: 혼합유인

Search Result 72, Processing Time 0.017 seconds

Scheduling Algorithms and Queueing Response Time Analysis of the UNIX Operating System (UNIX 운영체제에서의 스케줄링 법칙과 큐잉응답 시간 분석)

  • Im, Jong-Seol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.3
    • /
    • pp.367-379
    • /
    • 1994
  • This paper describes scheduling algorithms of the UNIX operating system and shows an analytical approach to approximate the average conditional response time for a process in the UNIX operating system. The average conditional response time is the average time between the submittal of a process requiring a certain amount of the CPU time and the completion of the process. The process scheduling algorithms in thr UNIX system are based on the priority service disciplines. That is, the behavior of a process is governed by the UNIX process schuduling algorithms that (ⅰ) the time-shared computer usage is obtained by allotting each request a quantum until it completes its required CPU time, (ⅱ) the nonpreemptive switching in system mode and the preemptive switching in user mode are applied to determine the quantum, (ⅲ) the first-come-first-serve discipline is applied within the same priority level, and (ⅳ) after completing an allotted quantum the process is placed at the end of either the runnable queue corresponding to its priority or the disk queue where it sleeps. These process scheduling algorithms create the round-robin effect in user mode. Using the round-robin effect and the preemptive switching, we approximate a process delay in user mode. Using the nonpreemptive switching, we approximate a process delay in system mode. We also consider a process delay due to the disk input and output operations. The average conditional response time is then obtained by approximating the total process delay. The results show an excellent response time for the processes requiring system time at the expense of the processes requiring user time.

  • PDF

Study of the rise and the characteristic of 'Hyangto Gakeuk' - focusing on the Composer Ahn Ki-Young's works (근대 '향토가극'의 형성과 특질 연구 - 안기영 작곡 가극 작품을 중심으로 -)

  • Yoo, In Gyeong
    • (The) Research of the performance art and culture
    • /
    • no.19
    • /
    • pp.221-280
    • /
    • 2009
  • This thesis is a study of the rise and the characteristic of 'Hyangto Gakeuk(literally Song drama of the country or local music drama)' in the Early 1940s. During the colonial period, there were attempts to incorporate traditional Korean music elements with Western operatic form. This type of music drama with librettos based on traditional tales came to be known as 'Hyangto Gakeuk'. Mostly 'Hyangto Gakeuk' has led this effort under the director Seo Hang-Suk, the composer Ahn Ki-Young and the lyricist Seol Eui-sik. In the first chapter, the study aims at arranging the performance history of 'Hyangto Gakeuk' composed by Ahn Ki-Young. Also, the study examined representative works after classifying 'Hyangto Gakeuk' performed by Lamila Music Drama Troupe, and Bando Music Drama Troupe. There is significant meaning to evaluate 'Hyangto Gakeuk' in the history of Korean music drama through this analysis of the performance history. In the second chapter, I will analyze with representative works composed by Ahn Ki-Young, a pioneer in the Korean art song. He tried to create the music that held the nationalism and tradition. His works which were called 'Kageuk' laid down the foundation of Korean original operatic style. This study demonstrated characteristics of 'Hyangto Gakeuk' as 'the beginning' in modern musical drama history and its effects on Korean musical drama developments. Namely, 'Hyangto Gakeuk' based on Korean traditions can be seen as examples of original modern musical in Korea. Practically, study on all the aspects of performance not only text generally studied, dramaturgy and criticism, but also performance concept and intention of creators in early period.