https://github.com/sysprog21/mergesort-concurrent
merge sort on singly-linked list utilzing POSIX Thread
https://github.com/sysprog21/mergesort-concurrent
Last synced: 4 months ago
JSON representation
merge sort on singly-linked list utilzing POSIX Thread
- Host: GitHub
- URL: https://github.com/sysprog21/mergesort-concurrent
- Owner: sysprog21
- License: other
- Created: 2016-10-03T03:56:37.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2017-03-17T08:24:45.000Z (over 9 years ago)
- Last Synced: 2025-06-14T00:03:37.402Z (about 1 year ago)
- Language: C
- Size: 1.02 MB
- Stars: 6
- Watchers: 3
- Forks: 66
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
- Authors: AUTHORS
Awesome Lists containing this project
README
# concurrent merge sort on singly-linked list
`mergesort-concurrent` implements merge sort on linked list concurrently.
Tasks give a framework for studying concurrency:
* Restricting number of threads in thread pools.
* Relaxing task boundaries so that overhead associated with task management
is kept reasonable.
The strategy to implement merge sort concurrently:
* Make recursive calls tasks
* No need to wait for tasks to complete after spawning them
* Tasks that creates sub-tasks can be allowed to terminated
## Build
```bash
make
```
## Run
```bash
./sort [thread count] [data count]
```
Then input integer data line-by-line
```bash
make check
```
Simple test suite.
# Licensing
`mergesort-concurrent` is freely redistributable under the two-clause BSD
License. Use of this source code is governed by a BSD-style license that can
be found in the `LICENSE` file.