The following pages link to Binoy Ravindran (Q202509):
Displaying 20 items.
- Utility accrual real-time scheduling for multiprocessor embedded systems (Q666020) (← links)
- T-L plane-based real-time scheduling for homogeneous multiprocessors (Q666041) (← links)
- Proactive resource allocation for asynchronous real-time distributed systems in the presence of processor failures. (Q1426217) (← links)
- Adaptive resource management algorithms for periodic tasks in dynamic real-time distributed systems. (Q1867348) (← links)
- HiperTM: high performance, fault-tolerant transactional memory (Q2357152) (← links)
- On scheduling garbage collector in dynamic real-time systems with statistical timing assurances (Q2642530) (← links)
- On Open Nesting in Distributed Transactional Memory (Q2985444) (← links)
- Space-Optimal, Wait-Free Real-Time Synchronization (Q4564129) (← links)
- Utility Accrual Real-Time Scheduling under Variable Cost Functions (Q4564132) (← links)
- Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model with Energy Bounds (Q4564220) (← links)
- Hyaline: Fast and Transparent Lock-Free Memory Reclamation (Q5145246) (← links)
- Highly Automated Formal Proofs over Memory Usage of Assembly Code (Q5164171) (← links)
- Least-Latency Routing over Time-Dependent Wireless Sensor Networks (Q5274399) (← links)
- Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks (Q5280681) (← links)
- Brief Announcement (Q5361954) (← links)
- An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms (Q5406282) (← links)
- Distributed Transactional Contention Management as the Traveling Salesman Problem (Q5496148) (← links)
- Resource management middleware for dynamic, dependable real-time systems (Q5943273) (← links)
- Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation. (Q6083446) (← links)
- Low-level reachability analysis based on formal logic (Q6535328) (← links)
