Scribd Logo
Importer

Bienvenue sur Scribd !

  • CDP-CS310: V - I Where: S - I: Start Time F - I: End Time M - I: Machine V - I: Value

    Transféré par

    Manjush Mangal
    8 vues1 page
    This lab involves scheduling n jobs over k machines to maximize the total value or reward, where each job has a start time, end time, machine assignment, and value. An algorithm must be designed to find a schedule where no two jobs overlap in time and the overall reward is maximized. The algorithm must be proven correct theoretically and with test cases, and its space and time complexities must be analyzed.

    Description originale:

    CDP- 310 lab 1

    Titre original

    lab01

    Copyright

    © © All Rights Reserved

    Formats disponibles

    PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    This lab involves scheduling n jobs over k machines to maximize the total value or reward, where each job has a start time, end time, machine assignment, and value. An algorithm must be designed to find a schedule where no two jobs overlap in time and the overall reward is maximized. The algorithm must be proven correct theoretically and with test cases, and its space and time complexities must be analyzed.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    8 vues1 page

    CDP-CS310: V - I Where: S - I: Start Time F - I: End Time M - I: Machine V - I: Value

    Transféré par

    Manjush Mangal
    This lab involves scheduling n jobs over k machines to maximize the total value or reward, where each job has a start time, end time, machine assignment, and value. An algorithm must be designed to find a schedule where no two jobs overlap in time and the overall reward is maximized. The algorithm must be proven correct theoretically and with test cases, and its space and time complexities must be analyzed.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 1

    CDP- CS310

    LAB - 01
    There are n jobs to be scheduled over k
    single core machines. Each job J_i has a
    four tuple associated to it <S_i, F_i, M_i,
    V_i> where :
    S_i
    F_i
    M_i
    V_i

    :
    :
    :
    :

    Start time
    End time
    Machine
    Value

    A schedule is defined as a list of jobs


    <J_5, J_2, ...> that can be executed
    together. Whenever any job J_i got executed
    a reward of value V_i got added to the
    Overall Reward.
    Design and implement an algorithm that can
    be used to derive a schedule such that :
    (a) No two jobs overlap in time.
    (b) The overall reward is maximized.
    Basically consider all possible feasible job
    schedule and maximize the Overall Reward.
    Prove the correctness of your algorithm
    theoretically as well as with
    different
    test cases. Also analyze its space and time
    complexities.

    Vous aimerez peut-être aussi