Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Batch Queues). Showing records 1 – 3 of 3 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Indian Institute of Science

1. Rajath Kumar, *. Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems.

Degree: 2012, Indian Institute of Science

Production parallel systems are space-shared and employ batch queues in which the jobs submitted to the systems are made to wait before execution. Thus, jobs submitted to parallel batch systems incur queue waiting times in addition to the execution times. Prediction of these queue waiting times is important to provide overall estimates to the users and can also help meta-schedulers make scheduling decisions. In the first part of our research, we have developed an integrated framework PQStar for identification and prediction of jobs with short queue waiting times. Analyses of the job traces of supercomputers reveal that about 56 to 99% of the jobs incur queue waiting times of less than an hour. Hence, identifying these quick starters or jobs with short queue waiting times is Essential for overall improvement on queue waiting time predictions. An important aspect of our prediction strategy for quick starters is that it considers the processor occupancy state and the queue state at the time of the job submission in addition to the job characteristics including the requested number of processors and the estimated runtime. Our experiments with different Production supercomputer job traces show that our prediction strategies can lead to correct identification of about 20% more quick starters on an average and provide tighter bounds for these jobs, and result in about 24% higher overall prediction accuracy on an average than the next best existing method. We have also developed a framework for predicting ranges of queue waiting times for other classes of jobs by employing multi-class classification on similar jobs in history. Our hierarchical prediction strategy first predicts the point wait time of a job using dynamic k- Nearest Neighbor (kNN) method. It then performs a multi-class classification using Support Vector Machines (SVMs) among all the classes of the jobs. The probabilities given by the SVM for the predicted class (obtained from the kNN), along with its neighboring classes, are used to provide a set of ranges of wait times with probabilities. Our experiments with different production supercomputer job traces show that our prediction strategies can lead to about 8% improved accuracy on an average in prediction of the non-quick starters, compared to the next best existing method. Finally, we have used these predictions and probabilities in a meta-scheduling strategy that distributes jobs to different queues/sites in a multi-queue/grid environment for minimizing wait times of the jobs. For a given target job, we first identify the queues/sites where the job can be a quick starter to get a set of candidate queues/sites for the scheduling of the job. We then compute the expected value of the predicted wait time in each of the candidate queues/sites, and schedule the job to the one with minimum expected value, for the execution of the job. We have performed experiments with different production supercomputer job traces and synthetic traces for various system sizes, partitioning schemes and different workloads. These… Advisors/Committee Members: Vadhiyar, Sathish.

Subjects/Keywords: Parallel Processing; Queuing Theory; PQStar (Predicting Quik Starters); Parallel Batch Systems - Metascheduling; Batch Processing; Metascheduling (Batch Systems); Batch Queues; Parallel Batch Systems; Queue Waiting Time Predictions; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rajath Kumar, *. (2012). Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2465

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rajath Kumar, *. “Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems.” 2012. Thesis, Indian Institute of Science. Accessed December 09, 2019. http://hdl.handle.net/2005/2465.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rajath Kumar, *. “Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems.” 2012. Web. 09 Dec 2019.

Vancouver:

Rajath Kumar *. Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/2005/2465.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rajath Kumar *. Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/2465

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

2. Rajath Kumar, *. Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems.

Degree: 2012, Indian Institute of Science

Production parallel systems are space-shared and employ batch queues in which the jobs submitted to the systems are made to wait before execution. Thus, jobs submitted to parallel batch systems incur queue waiting times in addition to the execution times. Prediction of these queue waiting times is important to provide overall estimates to the users and can also help meta-schedulers make scheduling decisions. In the first part of our research, we have developed an integrated framework PQStar for identification and prediction of jobs with short queue waiting times. Analyses of the job traces of supercomputers reveal that about 56 to 99% of the jobs incur queue waiting times of less than an hour. Hence, identifying these quick starters or jobs with short queue waiting times is Essential for overall improvement on queue waiting time predictions. An important aspect of our prediction strategy for quick starters is that it considers the processor occupancy state and the queue state at the time of the job submission in addition to the job characteristics including the requested number of processors and the estimated runtime. Our experiments with different Production supercomputer job traces show that our prediction strategies can lead to correct identification of about 20% more quick starters on an average and provide tighter bounds for these jobs, and result in about 24% higher overall prediction accuracy on an average than the next best existing method. We have also developed a framework for predicting ranges of queue waiting times for other classes of jobs by employing multi-class classification on similar jobs in history. Our hierarchical prediction strategy first predicts the point wait time of a job using dynamic k- Nearest Neighbor (kNN) method. It then performs a multi-class classification using Support Vector Machines (SVMs) among all the classes of the jobs. The probabilities given by the SVM for the predicted class (obtained from the kNN), along with its neighboring classes, are used to provide a set of ranges of wait times with probabilities. Our experiments with different production supercomputer job traces show that our prediction strategies can lead to about 8% improved accuracy on an average in prediction of the non-quick starters, compared to the next best existing method. Finally, we have used these predictions and probabilities in a meta-scheduling strategy that distributes jobs to different queues/sites in a multi-queue/grid environment for minimizing wait times of the jobs. For a given target job, we first identify the queues/sites where the job can be a quick starter to get a set of candidate queues/sites for the scheduling of the job. We then compute the expected value of the predicted wait time in each of the candidate queues/sites, and schedule the job to the one with minimum expected value, for the execution of the job. We have performed experiments with different production supercomputer job traces and synthetic traces for various system sizes, partitioning schemes and different workloads. These… Advisors/Committee Members: Vadhiyar, Sathish.

Subjects/Keywords: Parallel Processing; Queuing Theory; PQStar (Predicting Quik Starters); Parallel Batch Systems - Metascheduling; Batch Processing; Metascheduling (Batch Systems); Batch Queues; Parallel Batch Systems; Queue Waiting Time Predictions; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rajath Kumar, *. (2012). Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2465 ; http://etd.ncsi.iisc.ernet.in/abstracts/3180/G25589-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rajath Kumar, *. “Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems.” 2012. Thesis, Indian Institute of Science. Accessed December 09, 2019. http://etd.iisc.ernet.in/handle/2005/2465 ; http://etd.ncsi.iisc.ernet.in/abstracts/3180/G25589-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rajath Kumar, *. “Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems.” 2012. Web. 09 Dec 2019.

Vancouver:

Rajath Kumar *. Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Dec 09]. Available from: http://etd.iisc.ernet.in/handle/2005/2465 ; http://etd.ncsi.iisc.ernet.in/abstracts/3180/G25589-Abs.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rajath Kumar *. Prediction Of Queue Waiting Times For Metascheduling On Parallel Batch Systems. [Thesis]. Indian Institute of Science; 2012. Available from: http://etd.iisc.ernet.in/handle/2005/2465 ; http://etd.ncsi.iisc.ernet.in/abstracts/3180/G25589-Abs.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

3. ΚΑΤΣΑΡΟΣ, ΑΠΟΣΤΟΛΟΣ. ΣΥΜΒΟΛΗ ΣΤΗ ΘΕΩΡΙΑ ΣΥΣΤΗΜΑΤΩΝ ΕΞΥΠΗΡΕΤΗΣΗΣ ΜΕ ΠΡΟΤΕΡΑΙΟΤΗΤΕΣ ΚΑΙ ΔΙΑΚΟΠΕΣ.

Degree: 1996, Πανεπιστήμιο Ιωαννίνων; University of Ioannina

ΕΞΕΤΑΖΟΝΤΑΙ ΣΥΣΤΗΜΑΤΑ ΑΝΑΜΟΝΗΣ ΜΕ ΚΥΡΙΟ ΓΝΩΡΙΣΜΑ ΟΤΙ ΠΕΛΑΤΕΣ Ν-ΔΙΑΦΟΡΕΤΙΚΩΝ ΚΑΤΗΓΟΡΙΩΝ ΠΡΟΤΕΡΑΙΟΤΗΤΩΝ ΕΡΧΟΝΤΑΙ ΣΤΗΝ ΙΔΙΑ ΟΜΑΔΑ.ΟΙ ΕΞΥΠΗΡΕΤΗΣΕΙΣ ΤΩΝ ΠΕΛΑΤΩΝ ΑΚΟΛΟΥΘΟΥΝ ΓΕΝΙΚΕΣ ΚΑΤΑΝΟΜΕΣ,ΔΙΑΦΟΡΕΤΙΚΕΣ ΓΙΑ ΚΑΘΕ ΚΑΤΗΓΟΡΙΑ.Ο ΥΠΑΛΛΗΛΟΣ ΕΞΥΠΗΡΕΤΗΣΗΣ ΕΙΝΑΙ ΔΥΝΑΤΟΝ ΝΑ ΕΓΚΑΤΑΛΕΙΠΕΙ ΤΟ ΣΥΣΤΗΜΑ,ΟΤΑΝ ΔΕΝ ΥΠΑΡΧΟΥΝ ΠΕΛΑΤΕΣ,ΓΙΑ ΝΑΕΚΤΕΛΕΣΕΙ ΚΑΙ ΑΛΛΕΣ ΔΕΥΤΕΡΕΥΟΥΣΕΣ ΔΟΥΛΕΙΕΣ.ΕΞΕΤΑΖΟΝΤΑΙ ΔΥΟ ΕΙΔΗ ΠΡΟΤΕΡΑΙΟΤΗΤΩΝ(ΑΣΘΕΝΕΙΣ,ΙΣΧΥΡΕΣ).ΒΡΙΣΚΟΝΤΑΙ ΟΙ ΑΠΟ ΚΟΙΝΟΥ ΚΑΤΑΝΟΜΕΣ ΤΟΥ ΑΡΙΘΜΟΥ ΤΩΝ ΠΕΛΑΤΩΝ ΣΤΟ ΣΥΣΤΗΜΑ ΣΕ ΣΥΝΑΡΤΗΣΗ ΜΕ ΤΟΝ ΧΡΟΝΟ ΓΙΑ ΤΕΣΣΕΡΑ ΔΙΑΦΟΡΕΤΙΚΑ ΣΥΣΤΗΜΑΤΑ(ΑΣΘΕΝΕΙΣ-ΙΣΧΥΡΕΣ ΠΡΟΤΕΡΑΙΟΤΗΤΕΣ,ΜΕ-ΧΩΡΙΣ ΔΙΑΚΟΠΕΣ ΤΟΥ ΥΠΑΛΛΗΛΟΥ).ΤΕΛΟΣ ΔΙΝΟΝΤΑΙ ΜΕΣΕΣ ΤΟΥ ΑΡΙΘΜΟΥ ΤΩΝ ΠΕΛΑΤΩΝ ΣΤΟ ΣΥΣΤΗΜΑ ΧΩΡΙΣΤΑ ΓΙΑ ΚΑΘΕ ΚΑΤΗΓΟΡΙΑ ΠΕΛΑΤΩΝ,ΚΑΘΩΣ ΚΑΙ ΠΙΝΑΚΕΣ ΑΡΙΘΜΗΤΙΚΩΝ ΑΠΟΤΕΛΕΣΜΑΤΩΝ.

WE STUDY QUEUEING SYSTEMS WHERE CUSTOMERS ARRIVE IN BATCHES,AND EVERY BATCH CONTAINS CUSTOMERS HAVING DIFFERENT SERVICE PRIORITIES.CUSTOMERS BELONGING TO EVERY PRIORITY CLASS HAVE GENERALLY DISTRIBUTED SERVICE TIME (DIFFERENT FOR EACH CLASS).THE SERVER MAY LEAVE THE SYSTEM FOR VACATION WHEN THERE ARE NOT CUSTOMERSIN THE SYSTEM.WE EXAMINE TWO TYPES OF PRIORITIES(NON PREEMPTIVE AND PREEMPTIVE).WE FIND THE JOINT DISTRIBUTION OF THE NUMBER OF CUSTOMEERS IN THE SYSTEM,AS AFUNCTION OF TIME,FOR FOUR DIFFERENT SYSTEMS(NON PREEMPTIVE-PREMPTIVE WITH-WITHOUT VACATIONS).FINALLY WE GIVE THE MEAN VALUES OF THE NUMBER OF EACH CLASS CUSTOMER IN THE SYSTEM AND WE GIVE ALSO NUMERICAL EXAMPLES.

Subjects/Keywords: BATCH ARRIVALS; JOINT DISTRIBUTIONS OF CUSTOMERS; N-PRIORITY CLASSES; PREEMPTIVE-NON PREEMPTIVE PRIORITIES; Queues; VACATIONS; Διακοπές υπαλλήλου; ΚΑΤΑΝΟΜΗ ΑΡΙΘΜΟΥ ΠΕΛΑΤΩΝ ΣΤΟ ΣΥΣΤΗΜΑ; Ν-ΚΑΤΗΓΟΡΙΕΣ ΠΕΛΑΤΩΝ; ΟΜΑΔΟΠΟΙΗΜΕΝΕΣ ΑΦΙΞΕΙΣ; ΠΡΟΤΕΡΑΙΟΤΗΤΕΣ ΠΕΛΑΤΩΝ; ΣΥΣΤΗΜΑΤΑ ΑΝΑΜΟΝΗΣ(ΟΥΡΕΣ)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

ΚΑΤΣΑΡΟΣ, . (1996). ΣΥΜΒΟΛΗ ΣΤΗ ΘΕΩΡΙΑ ΣΥΣΤΗΜΑΤΩΝ ΕΞΥΠΗΡΕΤΗΣΗΣ ΜΕ ΠΡΟΤΕΡΑΙΟΤΗΤΕΣ ΚΑΙ ΔΙΑΚΟΠΕΣ. (Thesis). Πανεπιστήμιο Ιωαννίνων; University of Ioannina. Retrieved from http://hdl.handle.net/10442/hedi/8144

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

ΚΑΤΣΑΡΟΣ, ΑΠΟΣΤΟΛΟΣ. “ΣΥΜΒΟΛΗ ΣΤΗ ΘΕΩΡΙΑ ΣΥΣΤΗΜΑΤΩΝ ΕΞΥΠΗΡΕΤΗΣΗΣ ΜΕ ΠΡΟΤΕΡΑΙΟΤΗΤΕΣ ΚΑΙ ΔΙΑΚΟΠΕΣ.” 1996. Thesis, Πανεπιστήμιο Ιωαννίνων; University of Ioannina. Accessed December 09, 2019. http://hdl.handle.net/10442/hedi/8144.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

ΚΑΤΣΑΡΟΣ, ΑΠΟΣΤΟΛΟΣ. “ΣΥΜΒΟΛΗ ΣΤΗ ΘΕΩΡΙΑ ΣΥΣΤΗΜΑΤΩΝ ΕΞΥΠΗΡΕΤΗΣΗΣ ΜΕ ΠΡΟΤΕΡΑΙΟΤΗΤΕΣ ΚΑΙ ΔΙΑΚΟΠΕΣ.” 1996. Web. 09 Dec 2019.

Vancouver:

ΚΑΤΣΑΡΟΣ . ΣΥΜΒΟΛΗ ΣΤΗ ΘΕΩΡΙΑ ΣΥΣΤΗΜΑΤΩΝ ΕΞΥΠΗΡΕΤΗΣΗΣ ΜΕ ΠΡΟΤΕΡΑΙΟΤΗΤΕΣ ΚΑΙ ΔΙΑΚΟΠΕΣ. [Internet] [Thesis]. Πανεπιστήμιο Ιωαννίνων; University of Ioannina; 1996. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10442/hedi/8144.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

ΚΑΤΣΑΡΟΣ . ΣΥΜΒΟΛΗ ΣΤΗ ΘΕΩΡΙΑ ΣΥΣΤΗΜΑΤΩΝ ΕΞΥΠΗΡΕΤΗΣΗΣ ΜΕ ΠΡΟΤΕΡΑΙΟΤΗΤΕΣ ΚΑΙ ΔΙΑΚΟΠΕΣ. [Thesis]. Πανεπιστήμιο Ιωαννίνων; University of Ioannina; 1996. Available from: http://hdl.handle.net/10442/hedi/8144

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.