Data Structures and Algorithms with Object-Oriented Design Patterns in C

logo Website of Bruno R. Preiss
next up contents external
Next : Data Structures and Algorithms Up: Books Previous: Books

Data Structures and Algorithms with Object-Oriented Design Patterns in C#

  Bruno  Richard Preiss. Data Structures and Algorithms with Object-Oriented Design Patterns in C# . 2001. draft[46].
Preface. 1.  Introduction. 2.  Algorithm Analysis. 3.  Asymptotic Notation. 4.  Foundational Data Structures. 5.  Data Types and Abstraction. 6.  Stacks, Queues and Deques. 7.  Ordered Lists and Sorted Lists. 8.  Hashing, Hash Tables and Scatter Tables. 9.  Trees. 10.  Search Trees. 11.  Heaps and Priority Queues. 12.  Sets, Multisets and Partitions. 13.  Garbage Collection. 14.  Algorithmic Patterns and Problem Solvers. 15.  Sorting Algorithms and Sorters. 16.  Graphs and Graph Algorithms. A.  C# and Object-Oriented Programming. B.  Class Hierarchy Diagrams. C.  Character Codes. Index.

Copyright 2001 by Bruno R. Preiss.

external Full text. external BibTeX entry.



bruno Copyright 2002 by Bruno R. Preiss, P.Eng. All rights reserved.
Tue Jan 1 13:41:25 EST 2002

logo Website of Bruno R. Preiss
next up contents external
Next : Effects of the Checkpoint Up: Technical Reports Previous: Technical Reports

Transputer System User Guide-Second Edition

  Bruno  Richard Preiss and Neil  L. Shipp. CCNG Technical Report E-240, Department of Electrical and Computer Engineering and Computer Communications Networks Group, University of Waterloo, 1995[62].
1.  Introduction, 2.  Transputer Configurations, 3.  Compiling a C Program for a Uniprocessor, 4.  Compiling a C++ Program for a Uniprocessor, 5.  Compiling a C Program for a Multiprocessor, 6.  Compiling a C++ Program for a Multiprocessor, A.   batch Manual Page, B.   batchcancel Manual Page, C.   batchqueue Manual Page, D.   icc Manual Page, E.   icconf Manual Page, F.   iccxx Manual Page, G.   icollect Manual Page, H.   ilibr Manual Page, I.   ilink Manual Page, J.   iserver Manual Page, K.   mms Manual Page, L.   topology Manual Page.

Copyright 1995 by Computer Communications Networks Group, University of Waterloo.

external Full text. external BibTeX entry.



bruno Copyright 2002 by Bruno R. Preiss, P.Eng. All rights reserved.
Tue Jan 1 13:41:25 EST 2002

logo Website of Bruno R. Preiss
next up contents external
Next : Transputer System User Guide Up: Technical Reports Previous: Transputer System User Guide-Second

Effects of the Checkpoint Interval on Time and Space in Time Warp

  Bruno  Richard Preiss, Wayne  Mervin Loucks, and Ian  Donald MacIntyre. CCNG Technical Report E-230, Department of Electrical and Computer Engineering and Computer Communications Networks Group, University of Waterloo, June 1993[57].
Optimistically synchronized parallel discrete-event simulation is based on the use of communicating sequential processes. Optimistic synchronization means that the processes proceed under the assumption that a synchronized execution schedule is fortuitous. Periodic checkpointing of the state of a process allows the process to roll back to an earlier state when synchronization errors are detected . This paper examines the effects of varying the checkpoint interval on the execution time and memory space needed to perform a parallel simulation.

The empirical results presented in this paper were obtained from the simulation of closed stochastic queueing networks with several different topologies. Various intra-processor process scheduling algorithms and both lazy and aggressive cancellation strategies are considered . The empirical results are compared with analytical formulae predicting time-optimal checkpoint intervals. Two modes of operation, throttling and thrashing have been noted and their effect examined. As the checkpoint interval is increased from one, there is a throttling effect among processes on the same processor which improves performance. When the checkpoint interval is made too large, there is a thrashing effect caused by interaction between processes on different processors. It is shown that the time-optimal and space-optimal checkpoint intervals are not the same. Furthermore, a checkpoint interval that is too small adversely affects space more than time; whereas, a checkpoint interval that is too large adversely affects time more than space.

Copyright 1993 by Association for Computing Machinery, Inc.

external Full text. external BibTeX entry.



bruno Copyright 2002 by Bruno R. Preiss, P.Eng. All rights reserved.
Tue Jan 1 13:41:25 EST 2002