default search action
IBM Journal of Research and Development, Volume 19, 1975
Please be aware that the table of contents given here is incomplete.
Volume 19, Number 1, January 1975
- Eric Keppel:
Approximating Complex Surfaces by Triangulation of Contour Lines. 2-11 - William H. Burge:
Stream Processing Functions. 12-25 - David B. Lomet:
Scheme for Invalidating References to Freed Storage. 26-35 - K. Mani Chandy, Ulrich Herzog, Lin S. Woo:
Parametric Analysis of Queuing Networks. 36-42 - K. Mani Chandy, Ulrich Herzog, Lin S. Woo:
Approximate Analysis of General Queuing Networks. 43-49 - Ernesto F. Yhap:
Keybord Method for Composing Chinese Characters. 60-70 - Chu P. Wang, Hartmut Wedekind:
Segment Synthesis in Logical Data Base Design. 71-77 - Thomas W. Gay Jr., Philip H. Seaman:
Composite Priority Queue. 78-81
Volume 19, Number 2, March 1975
- Harold Fleisher, Leon I. Maissel:
An Introduction to Array Logic. 98-109 - Joseph C. L. Logue, Norman F. Brickman, Frank Howley, John Wyn Jones, Wei-Wha Wu:
Hardware Implementation of a Small System in Programmable Logic Arrays. 110-119 - John Wyn Jones:
Array Logic Macros. 120-126 - John E. McDonald Jr., Kenneth L. Sigworth:
Storage Hierarchy Optimization Procedure. 133-140 - Huei Ling, Frank P. Palermo:
Block-Oriented Information Compression. 141-145 - Arnold L. Rosenberg, James W. Thatcher:
What Is a Multilevel Array? 163-169 - Joseph A. Lukes:
Combinatiorial Solution to the Partitioning of General Graphs. 170-180 - Gernot Urschler:
Automatic Structuring of Programs. 181-194
Volume 19, Number 3, May 1975
- Yonathan Bard:
Application of the Page Survival Index (PSI) to Virtual-Memory System Performance. 212-220 - Peter Bryant:
Predicting Working Set Sizes. 221-229 - Walter F. Freiberger, Ulf Grenander, Paul D. Sampson:
Patterns in Program References. 230-243 - Domenico Ferrari:
Tailoring Programs to Models of Program Behavior. 244-251 - Martin Schatzoff, Coyt C. Tillman Jr.:
Design of Experiments in Simulator Validation. 252-262 - Willy W. Chiu, Donald N. Dumont, Roger C. Wood:
Performance Analysis of a Multiprogrammed Computer System. 263-271 - John H. Chang:
Terminal Response Times in Data Communications Systems. 272-282 - Martin Reiser, Hisashi Kobayashi:
Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms. 283-294 - Ulrich Herzog, Lin S. Woo, K. Mani Chandy:
Solution of Queuing Problems by a Recursive Technique. 295-300 - Charles H. Sauer, K. Mani Chandy:
Approximate Analysis of Central Server Models. 301-313 - We-Min Chow:
Central Server Model for Multiprogrammed Computer Systems with Different Classes of Jobs. 314-320
Volume 19, Number 4, July 1975
- Brian T. Bennett, Vincent J. Kruskal:
LRU Stack Processing. 353-357 - Se June Hong, Daniel L. Ostapko:
Codes for Self-Clocking, AC-Coupled Transmission: Aspects of Synthesis and Analysis. 358-365 - Roy A. Wood:
High-Speed Dynamic Programmable Logic Array Chip. 379-383 - Walter S. Rosenbaum, John J. Hilliard:
Multifont OCR Postprocessing System. 398-421 - E. Webb Stacy:
Comment on "Bulk Queue Model for Computer System Analysis". IBM J. Res. Dev. 19(4): 424-425 (1975)
Volume 19, Number 5, September 1975
- Eduardo B. Fernández, Tomás Lang:
Computation of Lower Bounds for Multiprocessor Schedules. 435-444 - Mohamed Z. Ghanem:
Dynamic Partitioning of the Main Memory Using the Working Set Concept. 445-450 - Mohamed Z. Ghanem:
Study of Memory Partitioning for Multiprogramming Systems with Virtual Memory. 451-457 - Stephen S. Lavenberg, Donald R. Slutz:
Introduction to Regenerative Simulation. 458-462 - Stephen S. Lavenberg, Donald R. Slutz:
Regenerative Simulation of a Queuing Model of an Automated Tape Library. 463-475 - Wei Chang:
Sequential Server Queues for Computer Communication System Analysis. 476-485 - Robert M. Wu, Yen-Bin Chen:
Analysis of a Loop Transmission System with Round-Robin Scheduling of Services. 486-493 - Ulrich Herzog:
Optimal Scheduling Strategies for Real-Time Computers. 494-504
Volume 19, Number 6, November 1975
- Malcolm C. Easton:
Model for Interactive Data Base Reference String. 550-556 - Donald P. Pazel:
Mathematical Construct for Program Reorganization. 575-581
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.