- test - 2 Updates
- My following projects were updated - 1 Update
- My C++ MemPool for real-time systems was updated to version 1.06 - 1 Update
- Efficient C++ Bounded Thread-Safe FIFO Queue and LIFO Stack for real-time systems - 1 Update
| rami17 <rami17@rami17.net>: Apr 04 12:47PM -0400 test |
| rami17 <rami17@rami17.net>: Apr 04 03:27PM -0400 test.... |
| aminer68@gmail.com: Apr 04 12:25PM -0700 Hello, My following projects were updated: My Efficient C++ Bounded Thread-Safe FIFO Queue and LIFO Stack for real-time systems was updated to version 1.05 You can download it from: https://sites.google.com/site/aminer68/efficient-c-bounded-thread-safe-fifo-queue-and-lifo-stack-for-real-time-systems And my C++ MemPool for real-time systems was updated to version 1.08 You can download it from: https://sites.google.com/site/aminer68/c-mempool-for-real-time-systems I have tested them thoroughly and they more stable and fast now. Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: Apr 04 07:54AM -0700 Hello, My C++ MemPool for real-time systems was updated to version 1.06 Description: Real-Time Memory Management In C++, memory management is normally performed using new,delete etc. The run-time system's heap offers great flexibility and efficiency, but it cannot fulfil real-time requirements. The run-time requirements are non-deterministic. In addition, they may require blocking task switches, which makes them unusable for interrupt handlers. MemPool uses templates and offers memory management with real-time capabilities through Memory Pools. A Memory Pool is an isolated heap with data buffers as objects of equal size. Any number of memory pools can exist simultaneously. A pool is initialized once and allocated a certain number of buffers as objects. Thereafter, buffers as objects can be allocated and deallocated from the pool under real-time conditions. How to use it? The parameters of the constructor are: The first parameter is the number of items and the second parameter is a boolean parameter that will tell MemPool to grow or not, if it is set to true it will grow, set it to false for real-time systems, if you don't pass any parameter, the number of items will be set to 200 and the MemPool will not grow and thus it will be set for real-time systems. The New() method returns a reference to the object, it's in O(1) time complexity. The Return() method returns the reference to the object to the stack, it 's in O(1) time complexity. Please look at the test.cpp example to learn how to use MemPool. Language: GNU C++ and Visual C++ and C++Builder You can download it from: https://sites.google.com/site/aminer68/c-mempool-for-real-time-systems Thank you, Amine Moulay Ramdane. |
| Ramine <toto1@toto1.net>: Apr 04 10:51AM -0400 Hello... Efficient C++ Bounded Thread-Safe FIFO Queue and LIFO Stack for real-time systems. Description: Efficient C++ Bounded Thread-Safe FIFO Queue and LIFO Stack for real-time systems, they are efficient and they eliminate false-sharing and they are FIFO fair and starvation-free. Language: GNU C++ and Visual C++ and C++Builder You can download it from here: https://sites.google.com/site/aminer68/efficient-c-bounded-thread-safe-fifo-queue-and-lifo-stack-for-real-time-systems Thank you, Amine Moulay Ramdane. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment