awesome-repositories.com
المدونة
awesome-repositories.com

اكتشف أفضل مستودعات المصادر المفتوحة باستخدام بحث مدعوم بالذكاء الاصطناعي.

استكشفعمليات بحث منسقةبدائل مفتوحة المصدربرمجيات ذاتية الاستضافةالمدونةخريطة الموقع
المشروعحولكيفية ترتيب النتائجالصحافةخادم MCP
قانونيالخصوصيةالشروط
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

2 مستودعات

Awesome GitHub RepositoriesParallel

Multi-threaded sorting algorithms that leverage task-parallel infrastructure for performance.

Distinct from Sorting Algorithms: Distinct from general sorting algorithms: focuses on parallel implementations.

Explore 2 awesome GitHub repositories matching software engineering & architecture · Parallel. Refine with filters or upvote what's useful.

Awesome Parallel GitHub Repositories

اعثر على أفضل المستودعات باستخدام الذكاء الاصطناعي.سنبحث عن أفضل المستودعات المطابقة باستخدام الذكاء الاصطناعي.
  • taskflow/taskflowالصورة الرمزية لـ taskflow

    taskflow/taskflow

    12,013عرض على GitHub↗

    Taskflow is a C++ task-parallel framework designed to build high-performance parallel workflows and complex dependency graphs. It provides a programming model that organizes computational work into directed acyclic graphs, enabling developers to manage concurrency, resource scheduling, and task dependencies across multi-core CPUs and GPU accelerators. The framework distinguishes itself through its ability to orchestrate heterogeneous systems, allowing for the integration of hardware-accelerated kernels and memory operations into unified execution pipelines. It supports dynamic runtime subflow

    Organizes collections of data using multi-threaded sorting algorithms that leverage task-parallel infrastructure.

    C++concurrent-programmingcuda-programminggpu-programming
    عرض على GitHub↗12,013
  • workiva/go-datastructuresالصورة الرمزية لـ Workiva

    Workiva/go-datastructures

    7,901عرض على GitHub↗

    go-datastructures is a collection of thread-safe and lock-free data structures designed for high-performance concurrent applications in Go. It provides a modular library of specialized algorithmic toolsets, including a lock-free collection library and an immutable data structure library. The project distinguishes itself through a suite of persistent AVL trees and hash array mapped tries that use branch-copying to preserve previous versions. It also implements non-blocking hash maps, queues, and tries that enable linearizable snapshots and concurrent updates without the use of mutual exclusion

    Implements multithreaded bucket sorting and symmetrical merging to accelerate the organization of massive datasets.

    Go
    عرض على GitHub↗7,901
  1. Home
  2. Software Engineering & Architecture
  3. Sorting Algorithms
  4. Parallel