word count information using message queues
標簽： information message queues count
上傳時間： 2017-03-16
上傳用戶：stewart·
queues implementation
標簽： implementation queues
上傳時間： 2017-04-05
上傳用戶：lingzhichao
Matlab: simulink mdl files for some basic queues.
標簽： simulink Matlab queues files
上傳時間： 2014-02-21
上傳用戶：xiaoyunyun
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
上傳時間： 2013-10-13
上傳用戶：13162218709
算法ebook(10部算法經典著作的合集) 算法ebook> 10部算法經典著作的合集 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
標簽： ebook Fundamentals Structures Ellis
上傳時間： 2015-04-04
上傳用戶：tfyt
十部經典算法合集 .chm Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni PREFACE CHAPTER 1: INTRODUCTION CHAPTER 2: ARRAYS CHAPTER 3: STACKS AND queues CHAPTER 4: LINKED LISTS CHAPTER 5: TREES CHAPTER 6: GRAPHS CHAPTER 7: INTERNAL SORTING CHAPTER 8: EXTERNAL SORTING CHAPTER 9: SYMBOL TABLES CHAPTER 10: FILES APPENDIX A: SPARKS APPENDIX B: ETHICAL CODE IN INFORMATION PROCESSING APPENDIX C: ALGORITHM INDEX BY CHAPTER
標簽： Fundamentals Structures Horowitz PREFACE
上傳時間： 2015-05-19
上傳用戶：維子哥哥
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.
標簽： Event-Driven Architecture Internet building
上傳時間： 2015-09-28
上傳用戶：日光微瀾
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
標簽： multithreading alternative Portable includes
上傳時間： 2016-03-25
上傳用戶：lz4v4
輕易學好C++編程技巧 - 進楷 (香港科技大學筆記 19課) 內容包括 1) base C++ review, 2) Pointers and Dynamic Objects, 3) Recursion,Linked Lists, 4) Stacks and queues, 5) Algorithm Analysis, 6) Insertion Sort and Mergesort, 7) Quicksort, 8) Heaps and Heapsort, 9) Lower Bound of Sorting and Radix Sort, 10) Binary Trees and Binary Search Trees 11) AVL Trees, 12) B+ Trees 13) Graphs and Breadth-First Search 14) Depth-First Search 15) Connected Components, Directed Graphs, 16) Topological Sort 17) Hashing 18) Pattern Matching 19) Additional Review
標簽： Pointers Dynamic Objects review
上傳時間： 2014-10-10
上傳用戶：chfanjiang
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
標簽： Pre-processor CppReference Reference Operator
上傳時間： 2016-10-26
上傳用戶：aeiouetla
