mgaYFp - Online IDE & Debugging Tool

#include <stdio.h>

#define N 5

typedef struct {
    char name[3];
    float arrival;
    float service;
    float start;
    float finish;
    float turnaround;
    float waiting;
    int done;
} Process;

int main() {
    Process p[N] = {
        {"P1", 0.0, 3.0},
        {"P2", 2.0, 6.0},
        {"P3", 4.0, 4.0},
        {"P4", 6.0, 5.0},
        {"P5", 8.0, 2.0}
    };

    int completed = 0;
    float time = 0.0;
    float sumTAT = 0.0, sumWait = 0.0, totalService = 0.0;
    int i, shortest;

    printf("\n===== SIMULATION SJF (non préemptif, float) =====\n");

    while (completed < N) {
        shortest = -1;
        float minService = 9999.0;

        // Find shortest job available at 'time'
        for (i = 0; i < N; i++) {
            if (!p[i].done && p[i].arrival <= time && p[i].service < minService) {
                minService = p[i].service;
                shortest = i;
            }
        }

        // If no process has arrived yet
        if (shortest == -1) {
            time += 0.5; // move time forward slightly
            continue;
        }

        // Execute selected process
        p[shortest].start = time;
        p[shortest].finish = p[shortest].start + p[shortest].service;
        p[shortest].turnaround = p[shortest].finish - p[shortest].arrival;
        p[shortest].waiting = p[shortest].turnaround - p[shortest].service;
        p[shortest].done = 1;

        time = p[shortest].finish;
        completed++;

        sumTAT += p[shortest].turnaround;
        sumWait += p[shortest].waiting;
        totalService += p[shortest].service;
    }

    float avgTAT = sumTAT / N;
    float avgWait = sumWait / N;
    float throughput = (float)N / time;
    float cpuUtil = (totalService / time) * 100.0;

    printf("\n%-8s%-10s%-10s%-10s%-10s%-10s%-10s\n",
        "Process", "Arrive", "Service", "Start", "Finish", "Tr", "Tw");
    printf("---------------------------------------------------------------\n");

    for (i = 0; i < N; i++) {
        printf("%-8s%-10.1f%-10.1f%-10.1f%-10.1f%-10.1f%-10.1f\n",
            p[i].name, p[i].arrival, p[i].service,
            p[i].start, p[i].finish, p[i].turnaround, p[i].waiting);
    }

    printf("\n--- Résultats globaux ---\n");
    printf("Temps moyen de rotation : %.2f\n", avgTAT);
    printf("Temps moyen d'attente   : %.2f\n", avgWait);
    printf("Débit du système        : %.2f processus/unité de temps\n", throughput);
    printf("Utilisation du CPU      : %.2f %%\n", cpuUtil);

    // ===== Diagramme de Gantt =====
    printf("\n--- Diagramme de Gantt ---\n\n");

    // First line: bars
    for (i = 0; i < N; i++) {
        printf("|");
        int blocks = (int)(p[i].service * 2); // each unit = 0.5
        for (int j = 0; j < blocks; j++)
            printf("█");
    }
    printf("|\n");

    // Second line: process names
    for (i = 0; i < N; i++) {
        printf("%-3s", p[i].name);
        int blocks = (int)(p[i].service * 2);
        for (int j = 0; j < blocks; j++)
            printf("  ");
    }
    printf("\n");

    // Third line: time scale
    for (i = 0; i < N; i++) {
        if (i == 0)
            printf("%.1f", p[i].start);
        printf("%*.1f", (int)(p[i].service * 2), p[i].finish);
    }
    printf("\n");

    return 0;
}