FeaturesThe following standard features are provided.• Choice of RTOS scheduling policy1. Pre-emptive:Always runs the highest available task. Tasks of identical priorityshare CPU time (fully pre-emptive with round robin time slicing).2. Cooperative:Context switches only occur if a task blocks, or explicitly callstaskYIELD().• Co-routines (light weight tasks that utilise very little RAM).• Message queues• Semaphores [via macros]• Trace visualisation ability (requires more RAM)• Majority of source code common to all supported development tools• Wide range of ports and examples
算法ebook(10部算法經(jīng)典著作的合集) 算法ebook> 10部算法經(jīng)典著作的合集 chm格式 (1)Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni (2)Data Structures, Algorithms and Program Style Using C by James F. Korsh and Leonard J. Garrett (3)Data Structures and Algorithm Analysis in C by Mark Allen Weiss (4)Data Structures: From Arrays to Priority queues by Wayne Amsbury (5)Information Retrieval: Data Structures & Algorithms edited by William B. Frakes and Ricardo Baeza-Yates (6)Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest (7)Practical Data Structures in C++ by Bryan Flamig (8)Reliable Data Structures in C by Thomas Plum (9)Data Structures and Algorithms Alfred V. Aho, Bell Laboratories, Murray Hill, New Jersey John E. Hopcroft, Cornell University, Ithaca, New York Jeffrey D. Ullman, Stanford University, Stanford, California (10)DDJ Algorithms and Data Structures Articles
The Staged Event-Driven Architecture (SEDA) is a new design for building scalable Internet services. SEDA has three major goals:
To support massive concurrency, on the order of tens of thousands of clients per node
To exhibit robust performance under wide variations in load and,
To simplify the design of complex Internet services.
SEDA decomposes a complex, event-driven application into a set of stages connected by queues. This design avoids the high overhead associated with thread-based concurrency models, and decouples event and thread scheduling from application logic. SEDA enables services to be well-conditioned to load, preventing resources from being overcommitted when demand exceeds service capacity. Decomposing services into a set of stages also enables modularity and code reuse, as well as the development of debugging tools for complex event-driven applications.
PTypes (C++ Portable Types Library) is a simple alternative to the STL that includes multithreading and networking. It defines dynamic strings, variants, character sets, lists and other basic data types along with threads, synchronization objects, IP sockets and named pipes. PTypes also offers message queues as an alternative method of thread synchronization. Its main `target audience is developers of complex network daemons, robots or non-visual client/server applications of any kind
CppReference
對于c/c++的詳盡說明
C/C++ Reference
General C/C++
Pre-processor commands
Operator Precedence
Escape Sequences
ASCII Chart
Data Types
Keywords
Standard C Library
Standard C I/O
Standard C String & Character
Standard C Math
Standard C Time & Date
Standard C Memory
Other standard C functions
All C Functions
C++
C++ I/O
C++ Strings
C++ String Streams
Miscellaneous C++
C++ Standard Template Library
C++ Algorithms
C++ Vectors
C++ Double-Ended queues
C++ Lists
C++ Priority queues
C++ queues
C++ Stacks
C++ Sets
C++ Multisets
C++ Maps
C++ Multimaps
C++ Bitsets
Iterators
All C++ Functions
