VagelisN/SystemProgramming-Project-3 VagelisN/SystemProgramming-Project-3

  • Stars
    star
    1
  • Language
    C
  • Created over 5 years ago
  • Updated over 5 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
VagelisN/SystemProgramming-Project-3
github

VagelisN

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Implementation of a selective overhead mirroring system for multiple files transfer to a selected device using sockets and threads. The customer programm (MirrorInitiator) communicates with a server process (MirrorServer) that will create threads (MirrorManagers) to pull the requested files from remote devices through processes (ContentServers)

More Repositories

1

Sigmod-2018

Our implementation of radix hash join, using a job scheduler for multithread functionality ( also supports single-threaded execution) and query optimization.
C
2
star
2

SystemProgramming-Project-2

Implementation of a job management system using fork/exec, named pipes and signals. It consists of a coordinator (jms_coord) and a console(jms_console) and a bash script that collects stats. The user adds jobs to the console and the console sends via named pipes the job to be executed to the coordinator. The coordinator creates job pools in order to have multiple jobs being executed concurrently.
C
2
star
3

Database-Implementation-Project-2

B+ tree implementation in block level (given library).
C
1
star
4

Operating-Systems-fork-fifos

A 3 level hierarchy (Master, Handlers, Workers) of processes for drawing 2-D shapes using fork, exec, fifos.
C
1
star
5

Skip-List

Implementation of a Skip List and a hash table struct to keep entries. Insert O(n), Access O(1) or O(n) depending on the question.
C
1
star
6

Redisigning-ika.gr

Simple Html Css PHP project. We try to redisign ika.gr, in order to "fix" the most common problems using Nielsen's rules
PHP
1
star
7

SystemProgramming-Project-1

Implementation of structs (2 hash tables 1 heap) to keep a database of CDRs (call detail records) in the main memory. The two has tables are used to have instant O(1) access to the records. One hash table where the records are stored by caller and one that the records are stored by callee. The binary heap is used to find the top k% of the earnings from the calls.
C
1
star