Concerning the length of time slots for efficient gang scheduling

Applying gang scheduling can alleviate the blockade problem caused by exclusively used space-sharing strategies for parallel processing. However, the original form of gang scheduling is not practical as there are several fundamental problems associated with it. Recently many researchers have developed new strategies to alleviate some of these problems. Unfortunately, one important problem has not been so far seriously addressed, that is, how to set the length of time slots to obtain a good performance of gang scheduling. In this paper we present a strategy to deal with this important issue for efficient gang scheduling.

A league of extraordinary gentlemen: groupies and gang bangs in the NRL

An examination of the gendered approach to coverage of NRL players behaving badly. The chapter looks at how the ABC Four Corners program 'Code of Silence' brought the problem of star players' sexual predatory behaviour to a wider audience than just the NRL faithful. The chapter also looks at how the sports press can be complicit in maintaining a representation where the players can be seen as the victims of their own actions.

Gang scheduling with a queue for large jobs

Applying gang scheduling can alleviate the blockade problem caused by exclusively space-sharing scheduling. To simply allow jobs to run simultaneously on the same processors as in conventional gang scheduling, however, may introduce a large number of time slots in the system. In consequence the cost of context switches will be greatly increased, and each running job can only obtain a small portion of resources including memory space and processor utilisation and so no jobs can finish their computations quickly. Therefore, the number of jobs allowed to run in the system should be limited. In this paper we present some experimental results to show that by limiting real large jobs time-sharing the same processors and applying the backfilling technique we can greatly reduce the average number of time slots in the system and significantly improve the performance of both small and large jobs.

Concerning the length of time slots for efficient gang scheduling

Applying gang scheduling can alleviate the blockade problem caused by exclusively used space-sharing strategies for parallel processing. However, the original form of gang scheduling is not practical as there are several fundamental problems associated with it. Recently many researchers have developed new strategies to alleviate some of these problems. Unfortunately, one important problem has not been so far seriously addressed, that is, how to set the length of time slot to obtain a good performance of gang scheduling. With gang scheduling time is divided into time slots of equal length, the number of time slots introduced in the system forms a scheduling round and each new job is first allocated to a particular time slot and then starts to run in the following scheduling round. Ideally, the length of time slot should be set long to avoid frequent context switches and so to reduce the scheduling overhead. The number of time slots in a scheduling round should also be limited to avoid a large number of jobs competing for limited resources (CPU time and memory). Long time slots and the limited number of time slots in each scheduling round may cause jobs to wait for a long time before it can be executed after arrival, which can significantly affect the performance of jobs, especially short jobs which are normally expected to finish quickly. However, the performance of a short job can also suffer if the length of time slot is not long enough to let the short job complete in a single time slot. In this paper we present a strategy to deal with this important issue for efficient gang scheduling.

Press shop machine analysis and trending

Historically downtime data collection and reporting systems in many automotive body panel press shops has been somewhat adhoc. The impetus for this study stems from frustration in respect of how this data is collected, assessed for trends and presented. Ideally this data should be used to identify costly repetitious faults for actioning of maintenance work and for feedback to tool design for consideration when designing new parts.

Presently this data is stored largely in the form of tacit knowledge by press shop operators; the encumbrance of transferring such information being that there is very often only limited channels to quantify it into something more tangible. Findings show that there tend to be two related obstacles to plant data recording. The first is that automation of down time data collection alone cannot determine fault causes as the majority of press shop events are initiated primarily from operator observation. The second is that excessive subjective operator input can often result in confusion and end up taking greater time in recording than remedying the actual fault.

This Paper presents the development of a system that through press mounted touchscreens encourages basic subjective operator input and relates this with basic objective data such as timekeeping. In this way all responses for a given press line become valuable and can be trended and placed in a hierarchy based on their percentage contribution to downtime or statistical importance. This then is capable of statistically alerting maintenance, line flow and/or toolbuild areas as to what issues require their most urgent attention.