В каталог

    Concurrent Programming

    514 курсов
    Leveraging the OS CPU Scheduler to Write Real-Time Multithreaded Applications
    Linux Foundation

    Leveraging the OS CPU Scheduler to Write Real-Time Multithreaded Applications

    Faster Ray Tracing with Multithreading - Ray Tracing Series
    The Cherno

    Faster Ray Tracing with Multithreading - Ray Tracing Series

    Finding and Fixing Slow Code - Ray Tracing Series
    The Cherno

    Finding and Fixing Slow Code - Ray Tracing Series

    Emulating NT Synchronization Primitives in Wine
    Linux Plumbers Conference

    Emulating NT Synchronization Primitives in Wine

    Improving CPU Isolation with Per-CPU Spinlocks - Performance Cost and Analysis
    Linux Plumbers Conference

    Improving CPU Isolation with Per-CPU Spinlocks - Performance Cost and Analysis

    Flow Based Programming Applied to IoT Development
    Linux Foundation

    Flow Based Programming Applied to IoT Development

    Explaining Different Coroutine Flavors Using Scala Native
    Scala Days Conferences

    Explaining Different Coroutine Flavors Using Scala Native

    Producer-Consumer Problem - Why Process Synchronization? - Race Condition - Operating System
    Sundeep Saradhi Kanthety

    Producer-Consumer Problem - Why Process Synchronization? - Race Condition - Operating System

    How State Machines Create Robust Software - Deep Dive
    Tejas Kumar

    How State Machines Create Robust Software - Deep Dive

    Pub Crawling in Orleans: Exploring the Actor Model - NDC Porto 2023
    NDC Conferences

    Pub Crawling in Orleans: Exploring the Actor Model - NDC Porto 2023

    Productive Parallel Programming with Dagger.jl - JuliaCon 2024 Workshop
    The Julia Programming Language

    Productive Parallel Programming with Dagger.jl - JuliaCon 2024 Workshop

    Sound Dynamic Deadlock Prediction in Linear Time
    ACM SIGPLAN

    Sound Dynamic Deadlock Prediction in Linear Time

    Concurrent Mutation Must Go
    ACM SIGPLAN

    Concurrent Mutation Must Go

    CQS: A Formally-Verified Framework for Fair and Abortable Synchronization
    ACM SIGPLAN

    CQS: A Formally-Verified Framework for Fair and Abortable Synchronization

    Concurrent Immediate Reference Counting
    ACM SIGPLAN

    Concurrent Immediate Reference Counting

    A Proof Recipe for Linearizability in Relaxed Memory Separation Logic
    ACM SIGPLAN

    A Proof Recipe for Linearizability in Relaxed Memory Separation Logic

    DisLog: A Separation Logic for Disentanglement
    ACM SIGPLAN

    DisLog: A Separation Logic for Disentanglement

    What Compilers Desire from Weak Memory Semantics
    ACM SIGPLAN

    What Compilers Desire from Weak Memory Semantics

    Programmers Love Mind-Bogglingly Complicated Weak Memory Models
    ACM SIGPLAN

    Programmers Love Mind-Bogglingly Complicated Weak Memory Models

    Designing Wait-free Weak Reference Counting
    ACM SIGPLAN

    Designing Wait-free Weak Reference Counting

    Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing
    ACM SIGPLAN

    Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing