• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.5 no.1
• /
• pp.83-87
• /
• 1980

The distributive processing job in a hierarchical computer network, which supervises and controls the complex relations between the variables periodically for raising the fault folerance, can be defined its periodicity and its execution time. All the job may be composed of the subsets in relation of Tree structure. For a processor job set this paper finds out a job scheduling algorithm that has the less loose time between period than that of FCFS.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.181-181
• /
• 2000

We identified the performance problems of scheduling algorithms such as FCFS, and demonstrated the superiority of WFQ in terms of realtime performance measures. For this purpose, we presented the service scenario and performed the analysis for the delay bound and fairness which are required to support the realtime applications in the Internet.

• Journal of Internet Computing and Services
• /
• v.9 no.3
• /
• pp.59-67
• /
• 2008

New system solves scheduling problem in medical services. The existing scheduling system by FCFS is for a hospital but new system expresses the condition of a hospital and the profit of separate system's parties by the automated negotiation. This system expresses user preference time as a priority number and is designed that the schedule is changed according to the priority number with a negotiation strategy for a patient. And a hospital makes a schedule according to the policy. The system supports customer satisfaction in medical services by considering not only equipment efficiency but also the patent waiting time unlike the existing system considering the idle time for a equipment.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.3
• /
• pp.197-206
• /
• 2007

The waiting delays of internet VOD users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes an unfair service to users and increases the possibility of higher reneging rates. This paper proposes an efficient service scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. Experimental results of simulations show that the proposed scheme improves about 20 percentage of average waiting time and reduces significantly the starving requesters comparing with those of conventional methods such as FCFS and MQL.

• Journal of Internet of Things and Convergence
• /
• v.3 no.1
• /
• pp.21-24
• /
• 2017

Modern computers have to deal with multiple processes. The operating system uses scheduling to handle many processes with a small number of CPUs. Types of scheduling include FCFS, SJF, and RR. Of these, RR shall determine the maximum allocation time. In this paper, we analyzed the GLM algorithm for specific samples to find the optimal maximum allocation time. This analysis method allows us to specify the maximum allocation time according to the desired conditions.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.989-998
• /
• 2002

The waiting delays of users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes m unfair service to users and increases the possibility of higher reneging rates. This paper proposes an leagued batching scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. The proposed scheme given intervals based on the league which reflect the disk partitions service patterns and user requests. Experimental results of simulations show that the proposed scheme improves about 18 percentage of average waiting time comparing with those of conventional methods such as FCFS and MQL.

• The Journal of the Korea Contents Association
• /
• v.20 no.10
• /
• pp.510-521
• /
• 2020

Recently, transparency in accounting for medical institutions has been emphasized. However, due to the current system problems and structural limitations, there is a lack of diagnosis on the financial status of domestic hospitals. This study is based on the financial statements per 100 beds of 374 including domestic hospital level to tertiary hospital, and analyzed the Free Cash Flow(FCF) by hospital size from the perspective of Free Cash Flow Hypothesis. After deriving Operating Cash Flow(OCF) through the profit or loss statement of medical institutions, FCFs were analyzed through the prior and current financial statements and OCFs, and the correlation between financial variables was confirmed. According to the analysis, first, hospitals with 160 to 299 beds and 300 beds or more have relatively high FCFs. Second, certified tertiary hospitals, hospitals with less than 160 beds, and general hospitals have negative(-) FCFs. Thus, there's a need to narrow the FCF gap based on the size of the hospital, maintaining an appropriate level of FCF. This study is meaningful in that it was the first FCF analysis based on hospital size. This study is also expected to offer an informative resources in setting differentiated strategies according to the size of medical institutions when establishing new accounting policies in the future.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.1
• /
• pp.141-149
• /
• 1999

In this paper, we consider multiple-class queueing systems in which the server starts a set-up as soon as the number of customers in the "start-up class" reaches threshold N. After the set-up the server starts his service. We obtain the Laplace-Stieltjes transform and the mean of the waiting times of each class of customers for FCFS and non-preemptive priority disciplines.

• Journal of applied mathematics & informatics
• /
• v.2 no.2
• /
• pp.21-46
• /
• 1995

Congestion and memory occupancy in computer system may be reduced further if new jobs are admitted only when the num-ber of jobs queued at CPU is below CPU run queue cutoff (RQ). In this paper we prove that response time of a job is invariant with respect to RQ if jobs do not communicate each other. We also demonstrate this invariance property numerically using marix-geometric methods and present an approximate method for the delay due to context switch-ing under time slicing. The approximation suggests that time slicing with constant overhead yields a throughput similar to an FCFS system without overhead.

• Communications of the Korean Mathematical Society
• /
• v.13 no.2
• /
• pp.405-434
• /
• 1998

We consider an M/M/c queue with two types of custormers, positive customers and negative customers. Positive customers are ordinary ones who upon arrival, join a queue with the intention of getting served and each arrival of negative customer removes a positive customer in the system, if any presents, and then is disappeared immediately. The Laplace-Stieltjes transforms (LST's) of the sojourn time distributions of a tagged customer, joinly with the probability that the tagged customer completes his service without being removed are derived under the combinations of various service displines; FCFS, LCFS and PS and removal strategies; RCF, RCH and RCR.