by Rabindra P. Kar
The beauty of data-flow architectures, as Robin explains here, is that they let you harness the power of multiple processors to process a stream of data in a sequential algorithm.
by Mark Streich
Mark uses the DESQview API to develop dvmake, a parallel make that can easily run four tasks at once, and that you can use it to write a real-time tty controller.
by N. H. Gehani and W. D. Roome
Concurrent C is designed to extend C for parallel programming. Here, the designers of the language use it to write a real-time tty controller.
by Andrew Schulman
Andrew explains the hows and whys of run-time dynamic linking under OS/2, and writes a mini C interpreter in the process.
by Anders Hjelsberg
When packaged in library modules, container objects can extend the underlying programming language by adding stacks, queues, trees, dynamic arrays, hash tables, and other such data structures.
by Steve Heller
With KRAM--Steve's "keyed random access method" program--you can retrieve any record in a multimegabyte file with a single disk access and any record in any size file with a maximum of two accesses.
by Barr E. Bauer
In this month's "Examining Room," Barr explores the parallelization scheme implemented by Silicon Graphics, using a Fortran test program to get to the bottom line of high-performance computing.
by Michael Swaine
Mike looks at two early neural net implementations, MINOS II and ADAM I, both of which used analog devices to implement parallel algorithms in largely discrete systems.
by Al Stevens
Al develops a linked list class for C++ and takes a quick look at what's available in the way of C++ compilers and preprocessors. When it comes to ANSI C, Al finds that some things have changed, while other things never do.
by Jeff Duntemann
Jeff and his cast of characters examine the subject of polymorphism and how object-oriented Pascal programmers can use it to their advantage.
by Jonathan Erickson
by you
by Michael Swaine
compiled by Janna Custer
Copyright © 1989, Dr. Dobb's Journal