• Journal of Computing Science and Engineering
• /
• v.6 no.4
• /
• pp.287-293
• /
• 2012

We introduce a methodology for the study of the application-level performance of time-sharing parallel jobs on a set of compute nodes in high performance clusters and report our findings. We assume that parallel jobs arriving at a cluster need to share a set of nodes with the jobs of other users, in that they must compete for processor time in a time-sharing manner and other limited resources such as memory and I/O in a space-sharing manner. Under the assumption, we developed a methodology to simulate job arrivals to a set of compute nodes, and gather and process performance data to calculate the percentage slowdown of parallel jobs. Our goal through this study is to identify a better combination of jobs that minimize performance degradations due to resource sharing and contention. Through our experiments, we found a couple of interesting behaviors for overlapped parallel jobs, which may be used to suggest alternative job allocation schemes aiming to reduce slowdowns that will inevitably result due to resource sharing on a high performance computing cluster. We suggest three job allocation strategies based on our empirical results and propose further studies of the results using a supercomputing facility at the San Diego Supercomputing Center.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.511-525
• /
• 2004

we model communication and computer systems that process interactive and several and several types of background jobs. The scheduling policy in use is to share the processor among all interactive jobs and, at most, one background job of each type at a time according to the process sharing discipline. Background jobs of each type are served on a first-come-first-served basis. Such scheduling policy is called Processor Sharing with Background jobs (PSBJ). In fact, the PSBJ policy is commonly used on many communication and computer systems that allow interactive usage of the systems and process certain jobs in a background mode. In this paper, the stability conditions for the PSBJ policy are given and proved. Since an exact analysis of the policy seems to be very difficult, an approximate analytic model is proposed to obtain the average job sojourn times. The model requires the solution of a set of nonlinear equations, for which an iterative algorithm is given and its convergence is proved. Our results reveal that the model provides excellent estimates of average sojourn times for both interactive and background jobs with a few percent of errors in most of the cases considered.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.1
• /
• pp.87-98
• /
• 2016

A single machine scheduling problem for jobs with stochastic processing time is considered in this study. Shortest processing time (SPT) sequencing according to the expected processing times of jobs is optimal for schedules with minimal expected mean flow time when all the jobs arrive to be scheduled and their expected processing times are known. However, SPT sequencing according to the expected processing time may not be optimal for the minimization of the mean flow time when the actual processing times of jobs are known. This study evaluates the complexity of SPT sequencing through a comparison of the mean flow times of schedules based on the expected processing times and actual processing times of randomly generated jobs. Evaluation results show that SPT sequencing according to the expected flow time exhibits chaotic variation to the optimal mean flow time. The relative deviation from the optimal mean flow time increases as the number of jobs, processing time, or coefficient of variation increases.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.4
• /
• pp.257-265
• /
• 2009

This paper considers the hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. In hybrid flow shops, each job is processed through multiple production stages in series, each of which has multiple identical parallel machines. The problem is to determine the allocation of jobs to the parallel machines at each stage as well as the sequence of the jobs assigned to each machine. Due to the complexity of the problem, we suggest search heuristics, tabu search and simulated annealing algorithms with a new method to generate neighborhood solutions. In particular, to evaluate and select neighborhood solutions, three surrogate objectives are additionally suggested because not much difference in the number of tardy jobs can be found among the neighborhoods. To test the performances of the surrogate objective based search heuristics, computational experiments were performed on a number of test instances and the results show that the surrogate objective based search heuristics were better than the original ones. Also, they gave the optimal solutions for most small-size test instances.

• Fire Science and Engineering
• /
• v.27 no.3
• /
• pp.85-93
• /
• 2013

Modern fire fighting jobs have been expanded to include areas of rescue, emergency medical service as well as conventional fire suppression, so that load for fire fighting jobs has been increased. Specifically, musculoskeletal disorders (MSDs) such as low back injury have been considered as one of major industrial hazards in heavy manual material handling during fire fighting jobs. This study tried to evaluate risk levels and to prepare background for reducing risk levels associated with heavy manual material handling during fire fighting jobs. This study applied two major tools in evaluating heavy manual material handling jobs which were NLE (NIOSH Lifting Equation) and 3DSSPP (3D Static Strength Prediction Program). A risk index in terms of heavy manual material handling during fire fighting jobs was identified. This index consisted of seven risk levels ranged from nine points (the first level) to three points (the seventh level). There was no job associated with the first level (the highest risk level) of index. There was only one job (life saving job) belonging to the second level (the second highest risk level) of index. The third level had jobs such as usage of destruction equipment and lifting patient. A total of basic eighteen jobs was categorized into six different levels (2nd-7th levels) of index. The outcome of the study could provide a good basis for conducting job intervention, preparing good equipment and developing good education program in order to prevent and reduce MSDs including low back injury of fire fighting jobs.

• Journal of Korean Society of Transportation
• /
• v.36 no.3
• /
• pp.195-202
• /
• 2018

Jobs-housing balance refers to the situations where the employment (work) and housing (house) opportunity are coincided in certain geographical area. This paper aims to examine the impact of jobs-housing balance to traffic safety. In pursuing the above, this paper particularly focuses on modeling the traffic accidents by metropolitan area. The main results are as follows. First, three generalized linear models which are all statistically significant are developed. Jobs-housing balance factors are judged to significantly influence on traffic accidents in all models. Second, among common variables, the housing supply rate is analyzed to impact to decreasing, and economically active population and commuting trip attraction are analyzed to impact to increasing. Hence, the alleviation of jobs-housing mismatch is evaluated to be important. Finally, the jobs-housing and business trip rates in Seoul metropolitan area, and the cross-commuting rate in Busan-Ulsan metropolitan area are judged to be essential to transportation safety policies

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.39-60
• /
• 2017

In the Cloud, for the scheduling of parallel jobs, there are many tasks in a job and those tasks are executed concurrently on different VMs (Visual machines), where each task of the job will be executed synchronously. The goal of scheduling is to reduce the execution time and to keep the fairness between jobs to prevent some jobs from waiting more time than others. We propose a Cloud model which has multiple Clouds, and under this model, jobs are in different lists according to the waiting time of the jobs and every job has different parallelism. At the same time, a new method-ZOMT (the scheduling parallel tasks based on ZERO-ONE scheduling with multiple targets) is proposed to solve the problem of scheduling parallel jobs in the Cloud. Simulations of ZOMT, AFCFS (Adapted First Come First Served), LJFS (Largest Job First Served) and Fair are executed to test the performance of those methods. Metrics about the waiting time, and response time are used to test the performance of ZOMT. The simulation results have shown that ZOMT not only reduces waiting time and response time, but also provides fairness to jobs.

• Journal of Korean Clinical Health Science
• /
• v.4 no.4
• /
• pp.762-768
• /
• 2016

Purpose. This study was performed on survey related optician's perception of NCS and required jobs to develop curriculum of department of ophthalmic optics Methods. This study was to evaluate the questionnaire survey of 63 opticians working in Optometrist in Daegu Metropolitan City from November 1, 2016 to November 18, 2016. Results. As for the opticians who know about NCS, 23.8% of the respondents answered that the opticians' perception of NCS is very low. For the four required jobs of the technical part, less than 5 years of optometrists ; optometry 73.7% > fitting 47.4% > ophthalmic dispensing 36.8% > lensmeter 5.3%, more than 5 years and less than 10 years of optometrists ; optometry 84.6% > fitting 53.8% > lensmeter 46.2% > ophthalmic dispensing 38.5%, more than 10 years of optometrists ; optometry 67.7% > ophthalmic dispensing 51.4% > lensmeter 19.4% > fitting 16.1%. For the four required jobs of the management, less than 5 years of optometrists ; product 57.9% > service 47.4% > manners 10.6% > sales 5.3%, more than 5 years and less than 10 years of optometrists ; service 76.9% > product 53.9% > manners 46.2% > sales 38.5%, more than 10 years of optometrists ; service 45.2% > manners 42.0% > product 32.3% > sales 19.4%. Conclusions. Although there were 108 required jobs of the technical part and 94 required jobs of the management part, the technical level of the department of ophthalmic optics was satisfactory, but the classes of the management part were insufficient. It will be necessary to actively reflect the needs of industry through curriculums reform.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1934-1939
• /
• 2013

In this paper, we consider the online scheduling problem of jobs with deadlines. The jobs arrive over time and the scheduling algorithm has no information about the arriving jobs in advance. The jobs have the processing time of the equal length and the goal of the scheduling algorithm is to maximize the number of jobs completed in their deadlines. The performance of the online algorithm is compared with that of the optimal algorithm which has the full information about all the jobs. The raio of the two performances is called the competitive ratio. In general, the ratio is unbouned. So the case that the online algorithm can have more resources than the optimal algorithm is considered, which is called the resource augmentation analysis. In this paper, the online algorithm have more machines. We show that the online algorithm can have the same performance as the optimal algorithm.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.6
• /
• pp.181-186
• /
• 2023

In this study, it argues that adolescents lack awareness of the Fourth Industrial Revolution and lack of job expression in games, and suggests promising future vocational education through games. Various previous studies reviewed job education, limitations, and educational effects of online games, and studied job expression in the game from the perspective of future promising jobs, and 45 out of 200 jobs appeared in mobile simulation games. It was found that 'content creators', 'drone experts', and 'software developers' were expressed as promising jobs in the future. Although it has a limitation of investigating only the main character's job, it is meaningful that it pointed out that the current game does not sufficiently cover the functional aspects of vocational education for future promising jobs and suggested the need to reflect future promising jobs.