Rejalashtirish algoritmlari

#include <stdio.h>

typedef struct {
    char nomi;
    int davomiylik;
} Ish;

int main(void) {
    Ish ishlar[] = {{'A', 24}, {'B', 3}, {'C', 3}};
    int soni = 3;

    int joriy_vaqt = 0;
    int jami_kutish = 0;

    printf("%-6s %-12s %-10s %-10s\n", "Ish", "Davomiylik", "Boshlandi", "Kutdi");
    printf("----------------------------------------\n");

    for (int i = 0; i < soni; i++) {
        printf("%-6c %-12d %-10d %-10d\n",
               ishlar[i].nomi, ishlar[i].davomiylik, joriy_vaqt, joriy_vaqt);

        jami_kutish += joriy_vaqt;
        joriy_vaqt += ishlar[i].davomiylik;
    }

    printf("----------------------------------------\n");
    printf("O'rtacha kutish: %.2f birlik\n", (double) jami_kutish / soni);

    return 0;
}

#include <stdio.h>
#include <stdlib.h>

typedef struct {
    char nomi;
    int davomiylik;
} Ish;

int qisqa_boyicha(const void *a, const void *b) {
    const Ish *x = a;
    const Ish *y = b;

    return x->davomiylik - y->davomiylik;
}

int main(void) {
    Ish ishlar[] = {{'A', 24}, {'B', 3}, {'C', 3}};
    int soni = 3;

    qsort(ishlar, soni, sizeof(ishlar[0]), qisqa_boyicha);

    int joriy_vaqt = 0;
    int jami_kutish = 0;

    printf("%-6s %-12s %-10s\n", "Ish", "Davomiylik", "Kutdi");
    printf("--------------------------------\n");

    for (int i = 0; i < soni; i++) {
        printf("%-6c %-12d %-10d\n",
               ishlar[i].nomi, ishlar[i].davomiylik, joriy_vaqt);

        jami_kutish += joriy_vaqt;
        joriy_vaqt += ishlar[i].davomiylik;
    }

    printf("--------------------------------\n");
    printf("O'rtacha kutish: %.2f birlik\n", (double) jami_kutish / soni);

    return 0;
}

#include <stdio.h>

#define ISHLAR 3
#define KVANT 4

int main(void) {
    char nomlar[ISHLAR] = {'A', 'B', 'C'};
    int qolgan[ISHLAR] = {24, 3, 3};
    int tugadi[ISHLAR] = {0, 0, 0};

    int vaqt = 0;
    int tugagan_soni = 0;

    printf("Bajarilish tartibi: ");

    while (tugagan_soni < ISHLAR) {
        for (int i = 0; i < ISHLAR; i++) {
            if (qolgan[i] <= 0) {
                continue;
            }

            int bolak = (qolgan[i] < KVANT) ? qolgan[i] : KVANT;

            printf("%c ", nomlar[i]);
            vaqt += bolak;
            qolgan[i] -= bolak;

            if (qolgan[i] == 0) {
                tugadi[i] = vaqt;
                tugagan_soni++;
            }
        }
    }

    printf("\n\n%-6s %-12s\n", "Ish", "Tugadi");
    printf("--------------------\n");

    for (int i = 0; i < ISHLAR; i++) {
        printf("%-6c %-12d\n", nomlar[i], tugadi[i]);
    }

    return 0;
}

#include <stdio.h>
#include <stdlib.h>

typedef struct {
    char nomi;
    int davomiylik;
    int ustuvorlik;             /* kichik son - yuqori ustuvorlik */
} Ish;

int ustuvorlik_boyicha(const void *a, const void *b) {
    const Ish *x = a;
    const Ish *y = b;

    return x->ustuvorlik - y->ustuvorlik;
}

int main(void) {
    Ish ishlar[] = {
        {'A', 10, 3},
        {'B',  1, 1},
        {'C',  2, 4},
        {'D',  1, 5},
        {'E',  5, 2}
    };

    int soni = 5;

    qsort(ishlar, soni, sizeof(ishlar[0]), ustuvorlik_boyicha);

    int vaqt = 0;
    int jami_kutish = 0;

    printf("%-6s %-12s %-12s %-8s\n", "Ish", "Ustuvorlik", "Davomiylik", "Kutdi");
    printf("------------------------------------------\n");

    for (int i = 0; i < soni; i++) {
        printf("%-6c %-12d %-12d %-8d\n",
               ishlar[i].nomi, ishlar[i].ustuvorlik, ishlar[i].davomiylik, vaqt);

        jami_kutish += vaqt;
        vaqt += ishlar[i].davomiylik;
    }

    printf("------------------------------------------\n");
    printf("O'rtacha kutish: %.2f\n", (double) jami_kutish / soni);

    return 0;
}

nice -n 10 ./ogir_hisob      # past ustuvorlik bilan ishga tushirish
renice -n 5 -p 1234          # ishlayotgan jarayonni o'zgartirish

#include <stdio.h>
#include <unistd.h>
#include <sys/resource.h>
#include <errno.h>

int main(void) {
    errno = 0;
    int joriy = getpriority(PRIO_PROCESS, 0);

    if (errno != 0) {
        printf("Ustuvorlikni o'qib bo'lmadi\n");
        return 1;
    }

    printf("Joriy nice qiymati: %d\n", joriy);

    /* Ustuvorlikni pasaytiramiz (bu har doim mumkin) */
    if (setpriority(PRIO_PROCESS, 0, joriy + 5) == 0) {
        printf("Yangi nice qiymati : %d\n", getpriority(PRIO_PROCESS, 0));
        printf("Ustuvorlik pasaydimi? ha\n");
    }

    return 0;
}

chrt -m

SCHED_OTHER min/max priority    : 0/0
SCHED_FIFO min/max priority    : 1/99
SCHED_RR min/max priority    : 1/99
SCHED_BATCH min/max priority    : 0/0
SCHED_IDLE min/max priority    : 0/0
SCHED_DEADLINE min/max priority    : 0/0

#include <stdio.h>
#include <unistd.h>

int main(void) {
    long yadrolar = sysconf(_SC_NPROCESSORS_ONLN);

    printf("Yadrolar aniqlandi : %s\n", yadrolar > 0 ? "ha" : "yo'q");
    printf("Ko'p yadrolimi?    : %s\n", yadrolar > 1 ? "ha" : "yo'q");

    return 0;
}