System Abstraction Component Kit

Work & Resources for Systems Software

Cross-compatibility for threads, using pthreads and Windows threads

A lightweight C library of portability wrappers and data structures

Highly portable C system library: threads and synchronization primitives, sockets (TCP, UDP, SCTP), IPv4 and IPv6, IPC, hash functions (MD5, SHA-1, SHA-2, SHA-3, GOST), binary trees (RB, AVL) and more. Native code performance.

Project of Distributed Systems | BSc Computer Science FCUL

Old school JavaScript with fast C full text search, sql, lmdb, redis, https, websockets, curl, crypt and more.

Round Robin Scheduling Algorithm Simulation in C

Covers the principles of parallel computing and distributed systems, focusing on multi-threading, synchronization, and communication across networks.

C Language State Machine with Threads

Set of Algorithms.

The project simulates philosophers sharing a bowl of spaghetti, alternating between thinking and eating. The goal is to manage resource sharing to avoid deadlock and allow all philosophers to eat. It teaches concepts of synchronization and concurrency.

OS-Linux

loads is a simple library to benchmark C functions across a given number of threads.

The Philosophers project, part of the 42 school curriculum, focuses on concurrent programming using threads, mutexes, processes, and semaphores. It presents a variation of the well-known dining philosophers problem, allowing students to deepen their understanding of these essential concepts.

An implementation of the classic Dining Philosophers problem..

Contains all my home work solutions and my solutions for exams and old exams. done for the course on Operating Systems at MCI Innsbruck Department od DIgital Bussiness and Software Engineering

🧠💡 Philosophers Problem Simulation in C. A multithreading challenge where philosophers eat, think, and sleep without dying or stealing forks. Implements mutexes for synchronization and thread management.

A concurrent programming project that simulates the Dining Philosophers Problem. It explores process synchronization using threads, mutexes, processes, and semaphores to prevent deadlocks and manage resource sharing efficiently.