pajjilykk/OS-LABS
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

add gitignore

Browse Source
This commit is contained in:
pajjilykk
2026-04-23 10:36:29 +07:00
parent a729a9f68c
commit bdb432dc39
8 changed files with 381 additions and 123 deletions
Download Patch File Download Diff File Expand all files Collapse all files
main.cpp
+169 -109
View File
@@ -1,152 +1,212 @@
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <random>
#include <sstream>
#include <stdexcept>
#include <string>
#include <sys/ipc.h>
#include <sys/shm.h>
#include <sys/time.h>
#include <sys/wait.h>
#include <unistd.h>
#include <sys/time.h>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <sstream>
#include <vector>
using namespace std;
namespace {
#define MAX 100000
#define MAX_DEPTH 3
constexpr int kDefaultN = 20000;
constexpr int kDefaultMaxDepth = 3;
constexpr int kPreviewCount = 20;
struct SharedData {
int arr[MAX];
};
string now() {
timeval tv;
gettimeofday(&tv, NULL);
ostringstream oss;
oss << tv.tv_sec << "."
<< setfill('0') << setw(6) << tv.tv_usec;
std::string now() {
timeval tv{};
gettimeofday(&tv, nullptr);
std::ostringstream oss;
oss << tv.tv_sec << "." << std::setfill('0') << std::setw(6) << tv.tv_usec;
return oss.str();
}
void merge(int *arr, int l, int m, int r) {
int *temp = new int[r - l + 1];
void log_start(int l, int r, int depth) {
std::cout << "START PID=" << getpid() << " PPID=" << getppid() << " depth=" << depth
<< " range=[" << l << "," << r << "] time=" << now() << '\n'
<< std::flush;
}
int i = l, j = m + 1, k = 0;
void log_end(int l, int r, int depth) {
std::cout << "END PID=" << getpid() << " PPID=" << getppid() << " depth=" << depth
<< " range=[" << l << "," << r << "] time=" << now() << '\n'
<< std::flush;
}
void merge_range(int* arr, int l, int m, int r) {
std::vector<int> temp;
temp.reserve(r - l + 1);
int i = l;
int j = m + 1;
while (i <= m && j <= r) {
if (arr[i] < arr[j]) temp[k++] = arr[i++];
else temp[k++] = arr[j++];
if (arr[i] <= arr[j]) {
temp.push_back(arr[i++]);
} else {
temp.push_back(arr[j++]);
}
}
while (i <= m) temp[k++] = arr[i++];
while (j <= r) temp[k++] = arr[j++];
while (i <= m) {
temp.push_back(arr[i++]);
}
while (j <= r) {
temp.push_back(arr[j++]);
}
for (int x = 0; x < k; x++) arr[l + x] = temp[x];
delete[] temp;
std::copy(temp.begin(), temp.end(), arr + l);
}
void local_sort(int *arr, int l, int r) {
if (l >= r) return;
int m = (l + r) / 2;
local_sort(arr, l, m);
local_sort(arr, m + 1, r);
merge(arr, l, m, r);
}
void parallel_sort(int l, int r, int depth, int shmid) {
SharedData *data = (SharedData*) shmat(shmid, NULL, 0);
int *arr = data->arr;
string start_time = now();
cout << "START PID=" << getpid()
<< " PPID=" << getppid()
<< " depth=" << depth
<< " range=[" << l << "," << r << "]"
<< " time=" << start_time << "\n";
void local_sort(int* arr, int l, int r) {
if (l >= r) {
string end_time = now();
cout << "END PID=" << getpid()
<< " range=[" << l << "," << r << "]"
<< " time=" << end_time << "\n";
shmdt(data);
return;
}
int m = (l + r) / 2;
const int m = l + (r - l) / 2;
local_sort(arr, l, m);
local_sort(arr, m + 1, r);
merge_range(arr, l, m, r);
}
if (depth >= MAX_DEPTH) {
void parallel_sort(int* arr, int l, int r, int depth, int max_depth) {
log_start(l, r, depth);
if (l >= r) {
log_end(l, r, depth);
return;
}
const int m = l + (r - l) / 2;
if (depth >= max_depth) {
local_sort(arr, l, r);
string end_time = now();
cout << "END PID=" << getpid()
<< " depth=" << depth
<< " range=[" << l << "," << r << "]"
<< " time=" << end_time << "\n";
shmdt(data);
log_end(l, r, depth);
return;
}
pid_t left = fork();
if (left == 0) {
parallel_sort(l, m, depth + 1, shmid);
_exit(0);
parallel_sort(arr, l, m, depth + 1, max_depth);
_exit(EXIT_SUCCESS);
}
if (left < 0) {
std::perror("fork left");
local_sort(arr, l, m);
}
pid_t right = fork();
if (right == 0) {
parallel_sort(m + 1, r, depth + 1, shmid);
_exit(0);
parallel_sort(arr, m + 1, r, depth + 1, max_depth);
_exit(EXIT_SUCCESS);
}
waitpid(left, NULL, 0);
waitpid(right, NULL, 0);
if (right < 0) {
std::perror("fork right");
local_sort(arr, m + 1, r);
}
merge(arr, l, m, r);
int left_status = 0;
if (left > 0 && waitpid(left, &left_status, 0) < 0) {
std::perror("waitpid left");
local_sort(arr, l, m);
} else if (left > 0 && (!WIFEXITED(left_status) || WEXITSTATUS(left_status) != 0)) {
local_sort(arr, l, m);
}
string end_time = now();
int right_status = 0;
if (right > 0 && waitpid(right, &right_status, 0) < 0) {
std::perror("waitpid right");
local_sort(arr, m + 1, r);
} else if (right > 0 && (!WIFEXITED(right_status) || WEXITSTATUS(right_status) != 0)) {
local_sort(arr, m + 1, r);
}
cout << "END PID=" << getpid()
<< " depth=" << depth
<< " range=[" << l << "," << r << "]"
<< " time=" << end_time << "\n";
shmdt(data);
merge_range(arr, l, m, r);
log_end(l, r, depth);
}
int main() {
key_t key = ftok("shmfile", 65);
int shmid = shmget(key, sizeof(SharedData), 0666 | IPC_CREAT);
SharedData *data = (SharedData*) shmat(shmid, NULL, 0);
int n = 20000;
srand(time(NULL));
for (int i = 0; i < n; i++)
data->arr[i] = rand() % 100000;
cout << "Before:\n";
for (int i = 0; i < 20; i++)
cout << data->arr[i] << " ";
cout << "\n\n";
parallel_sort(0, n - 1, 0, shmid);
cout << "\nAfter:\n";
for (int i = 0; i < 20; i++)
cout << data->arr[i] << " ";
cout << "\n";
shmdt(data);
shmctl(shmid, IPC_RMID, NULL);
return 0;
bool parse_positive_int(const char* value, int& out) {
try {
size_t consumed = 0;
const int parsed = std::stoi(value, &consumed);
if (value[consumed] != '\0') {
return false;
}
if (parsed <= 0) {
return false;
}
out = parsed;
return true;
} catch (const std::invalid_argument&) {
return false;
} catch (const std::out_of_range&) {
return false;
}
}
} // namespace
int main(int argc, char* argv[]) {
int n = kDefaultN;
int max_depth = kDefaultMaxDepth;
if (argc >= 2 && !parse_positive_int(argv[1], n)) {
std::cerr << "Invalid array size: " << argv[1] << '\n';
return EXIT_FAILURE;
}
if (argc >= 3 && !parse_positive_int(argv[2], max_depth)) {
std::cerr << "Invalid max depth: " << argv[2] << '\n';
return EXIT_FAILURE;
}
const size_t shm_size = static_cast<size_t>(n) * sizeof(int);
const int shmid = shmget(IPC_PRIVATE, shm_size, IPC_CREAT | 0600);
if (shmid < 0) {
std::perror("shmget");
return EXIT_FAILURE;
}
int* arr = static_cast<int*>(shmat(shmid, nullptr, 0));
if (arr == reinterpret_cast<void*>(-1)) {
std::perror("shmat");
shmctl(shmid, IPC_RMID, nullptr);
return EXIT_FAILURE;
}
std::mt19937 rng(std::random_device{}());
std::uniform_int_distribution<int> dist(0, 99999);
for (int i = 0; i < n; ++i) {
arr[i] = dist(rng);
}
std::cout << "Before:\n";
for (int i = 0; i < std::min(n, kPreviewCount); ++i) {
std::cout << arr[i] << ' ';
}
std::cout << "\n\n";
parallel_sort(arr, 0, n - 1, 0, max_depth);
std::cout << "\nAfter:\n";
for (int i = 0; i < std::min(n, kPreviewCount); ++i) {
std::cout << arr[i] << ' ';
}
std::cout << '\n';
if (shmdt(arr) < 0) {
std::perror("shmdt");
}
if (shmctl(shmid, IPC_RMID, nullptr) < 0) {
std::perror("shmctl IPC_RMID");
}
return EXIT_SUCCESS;
}