操作系统
已释然
凡事不如看淡
展开
-
操作系统:The Sleeping Teaching Assistant
#include<stdio.h> #include<string.h> #include<pthread.h> #include<unistd.h> #include<semaphore.h> sem_t ta,student; pthread_mutex_t mutex; int waiting = 0; void* teaching(void *value); void* consulting(void *value); void* t原创 2021-07-07 16:24:34 · 1057 阅读 · 0 评论 -
操作系统:Banker’s Algorithm
#include <bits/stdc++.h> #include <pthread.h> #include <unistd.h> #include <windows.h> using namespace std; int available[maidn]={100,100,100,100}; // 可用资源 int maximum[maidn][maidn]; // 最大需求 int allocation[maidn][maidn]; // 已用资源 i原创 2021-07-07 16:22:56 · 357 阅读 · 0 评论 -
操作系统:The Dining Philosophers Problem
哲学家进餐问题 #include<stdio.h> #include<unistd.h> #include<pthread.h> #include<stdlib.h> pthread_mutex_t chopstick[5]; //5把锁,也就是5根筷子。 void*tfn(void *arg) { int i = (int)arg; int left,right; //左右筷子的编号。 if(i == 4) { left =原创 2021-07-07 16:21:03 · 191 阅读 · 0 评论 -
操作系统:Multithreaded Sorting Application
#include<stdio.h> #include<string.h> #include<pthread.h> #include<stdlib.h> typedef struct{ int start; int end; }parameters; int originList[10] = {7,12,19,3,18,4,2,6,15,8}; int sortedList[10] = {0}; int i,j; void* Sort(void *va原创 2021-05-22 20:25:30 · 573 阅读 · 0 评论 -
操作系统:Sudoku Solution Validator
#include<stdio.h> #include<pthread.h> #include<string.h> #include<stdlib.h> typedef struct { int row; int column; }parameters; int puzzle[9][9] = {{6,2,4,5,3,9,1,8,7},{5,1,9,7,2,8,6,3,4},{8,3,7,6,1,4,2,9,5},{1,4,3,8,6,5,7,2,9},{原创 2021-05-22 20:23:39 · 1086 阅读 · 2 评论 -
操作系统:Linux Kernel Module for Listing Tasks
遍历: #include <linux/sched.h> #include <linux/init.h> #include <linux/kernel.h> #include <linux/module.h> #include <linux/init_task.h> MODULE_LICENSE("GPL"); MODULE_AUTHOR("team 5"); int linear_init(void) { struct task_str原创 2021-05-22 20:21:13 · 1499 阅读 · 0 评论