Software Generalist

Book abbreviations correspond to titles on the picture from this link:

Cooperative Multireading Revisited and Started

POSA2: Widespread use of non-OO algorithmic decomposition in network and concurrent systems.

POSA5: Evolution in modeling and design. Design illusion.

AMP: Mutual exclusion (both excluded) problem with deadlock-freedom (if both want, one eventually succeeds), starvation-freedom (lockout-freedom, one eventually succeeds) and waiting properties.

EIP: Patterns: validation of understanding, reference and common vocabulary. Pattern realization in specific environment. Pattern cohesiveness. 

MM: Detaching threads in pthreads is similar to closing the last handle in Win32. In pthreads it is possible to create detached threads.

SC: Creativity: breaking traditional patterns. Dichotomy of two brain hemispheres.

ASS: ASAP is close to NOW. One-stop shopping.

SM: The necessity of impact analysis to determine potential ripple effects on existing environment/system.

CC: Software construction is central guaranteed activity. Source code is always up to date.

RP: Pedagogical patterns. Patterns: forces - tension - resolution by balancing forces with compromise - consequences

MES: A5/x algorithms to encrypt GSM communications

OOM: Fundamental split between OO databases and object-relational (OQL vs. SQL3).

TIS: Application- vs. System-provided recovery.

NAT: Addressing in OSI network layer 3 - networkId(flat|subnetted|hierarchical):hostId(flat)

PT: Generative grammar as fixed-size recipe for sentence construction. Platonic grammar as complete language description.

CW: E-mail and IM redirectors. Session hijacking.

PNA: Saltzer: application name -> node address -> point of attachment -> route. DNS as hierarchical distributed DB to replace host table.

CA: Simple RISC non-pipelining implementation: IF (instruction fetch) -> ID/RF (instruction decode/register fetch, fixed-field decoding) -> EX/EA (execution/effective address) -> MEM (memory access) -> WB (write-back).

GC: Pointer reachability from computation roots. The set of live heap nodes as transitive referential closure. Accessible nodes subsume live set. Direct counting vs. tracing.

CS: Ripple-carry of full adders and carry-propagation delay in adder networks.

- Dmitry Vostokov @ SoftwareGeneralist.com -

           

Announcements

Coming Soon:

Management Bits: An Anthology from Reductionist Manager

Crash Dump Analysis: Practical Foundations (Windows Edition, Systematic Software Fault Analysis Series)

Debugging Notebook: Essential Concepts, WinDbg Commands and Tools

Crash Dump Analysis for System Administrators and Support Engineers

New Magazines:

Debugged! MZ/PE: MagaZine for/from Practicing Engineers

New Books:

Memory Dump Analysis Anthology: Color Supplement for Volumes 1-3

Memory Dump Analysis Anthology, Volume 3

First Fault Software Problem Solving: A Guide for Engineers, Managers and Users

x64 Windows Debugging: Practical Foundations

Also available:

Windows Debugging: Practical Foundations

DLL List Landscape: The Art from Computer Memory Space

Dumps, Bugs and Debugging Forensics: The Adventures of Dr. Debugalov

WinDbg: A Reference Poster and Learning Cards

Memory Dump Analysis Anthology, Volume 2

Memory Dump Analysis Anthology, Volume 1

New Children's Book:

Baby Turing

This entry was posted on Tuesday, September 2nd, 2008 at 3:33 pm and is filed under Book Stack Dump, Reading Notebook, Software and Engineering, Software and Science. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.