DRMAA for Slurm: Implementation of the DRMAA C bindings for Slurm

Naturally embed read-only filesystems into C99-C++20 w. a single header, zero dependencies and zero modifications to your code

This is CS50x. Fall 2023 Solutions.

This project is CPULimit Patch for VM's CPU resource control,Forked from cpulimit project in sf.org

Flux RFC project

Walking philosophers

This repository contains comprehensive notes and code samples from the Master Class Course on Multi-Threading. Covering topics from basic to advanced—thread creation, race conditions, mutex, deadlocks, condition variables, and semaphores—it serves as a one-stop guide for mastering multi-threading in C/C++ on Linux.

A comprehensive implementation and guide to designing a state machine-based multiplexing system using Unix Domain Sockets. This repository covers both theoretical concepts and practical code examples to help you seamlessly integrate multiplexing into your Unix-based applications, ensuring efficient communication and resource management.

Rate limiting based on resource usage - either RAM and/or CPU.

Resource control and exception handling framework for C, 4th Generation

This repository include my cs50x: introduction to computer science week 0 to 7 problem sets solutions

Avoid deadlocks and synchronise threads to use resources equally.Using pthreads. AUEB Computer Science course Operating Systems.

BorgRL - 2023 7 Day Roguelike (7drl)

CS50 Harvard Course: abstraction, algorithms, data structures, encapsulation, resource management, security, software engineering, and web programming. Languages include C, Python, and SQL plus HTML, CSS, and JavaScript.

마이크로서비스의 자원사용량(cpu, memory, network, disk) 분석 연구

strategies for controlling systemd service resource usage + live demos with dummy services

Operating Systems

The Dining Philosopher Problem states that N philosophers seated around a circular table with one chopstick between each pair of philosophers. There is one chopstick between each philosopher. A philosopher may eat if he can pick up the two chopsticks adjacent to him. One chopstick may be picked up by any one of its adjacent followers but not both.

This project aims to simulate the classic synchronization challenge of the dining philosophers. It is about concurrent programming with threads and mutexes and processes.