Home > Mathematics and Science Textbooks > Science: general issues > The Architecture and Engineering of Digital Computer Complexes: Volume 2
1%
The Architecture and Engineering of Digital Computer Complexes: Volume 2

The Architecture and Engineering of Digital Computer Complexes: Volume 2

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

Table of Contents:
8 Computer Complexes.- 1. Synopsis.- 2. The Several Configurations of the Computer Complex.- 2.1. Definitions.- 2.2. The Design Problem.- 2.3. The Design Process.- 3. Translation Criteria.- 3.1. Special-Purpose Hardware.- 3.2. Evolution of the Semantic Configuration.- 3.3 Semantic vs. Syntactic Configurations.- 4. Processor Graphs.- 4.1. Relations.- 4.2. Matrix Representation of Graphs.- 4.3. Idempotency Property.- 4.4. Equivalence Relations.- 4.5. Partial Ordering.- 4.6. Further Definitions.- 4.7. Loop Connections and Equivalence.- 4.8. Predecessors and Successors.- 4.9. Dependent and Independent Node Sets.- 4.10. Applications.- 4.11. Extensions and Generalizations.- 5. Partitions.- 5.1. Extensive and Functional Partitions.- 5.2. General Advantages and Disadvantages.- 5.3. Partitions in Hardware.- 5.4. Partitions in Software.- 5.5. Mixed Partitions.- 5.6. Crossed Partitions.- 6. The Internal Communication Structure of Multicomputer Complexes.- 6.1. Generic Internal Communication Topologies.- 6.2. Channel Structures.- 6.3. Communication Analysis.- 6.4. Memory Placement and Communications.- 7. Summary.- 8. Problems.- 9. References.- 9 The Executive Processor.- 1. Synopsis.- 2. System Functions.- 2.1. The Executive.- 2.2. Job Control-Accountability.- 2.3. Scheduling and Optimization.- 2.4. Priority, Authority, Security, and Privacy.- 2.5. Operations Monitoring, Statistics, and Accounting.- 2.6. Operations.- 2.7. Maintenance.- 2.8. Memory Management.- 2.9. Queue Control.- 2.10. I/O Control and Buffering.- 2.11. File Management.- 2.12. Communication.- 2.13. Viability.- 2.14. The Firmware Library.- 3. The Executive Processor.- 3.1. Executive Parameters.- 3.2. The Isochronous Executive.- 3.3. The Asynchronous Executive.- 3.4. The Anisochronous Executive.- 3.5. The Real Executive.- 3.6. The Cyclically Structured Executive.- 3.7. The Multilevel Executive.- 3.8. Determination of Level.- 3.9. Multicomputer Executive Structures.- 4. Job Control.- 4.1. Jobs and Tasks.- 4.2. Job Assessment.- 4.3. Error Control.- 4.4. Interjob Control.- 4.5. File Management Interface.- 4.6. Job Status.- 4.7. Accountability.- 5. Scheduling and Optimization.- 5.1. Objectives.- 5.2. System Status Tables.- 5.3. Optimization Methods and Goals.- 5.4. Spooling.- 6. Priority, Authority, Security, and Privacy.- 6.1. Priority.- 6.2. Authority and Security.- 7. Statistics, Operations Monitoring, and Accounting.- 7.1. Logging.- 7.2. Statistics.- 7.3. Accounting.- 8. Operation.- 8.1. Communications.- 8.2. Interpretation.- 8.3. Training Modes.- 9. Maintenance.- 10. Summary.- 11. Problems.- 12. References.- 10 The Nucleus.- 1. Synopsis.- 2. Memory Management.- 2.1. Why Memory Management?.- 2.2. Dynamic Storage Allocation.- 2.3. Segmentation and Paging.- 2.4. Memory Scheduling.- 3. Buffer Methods.- 3.1. What and Why.- 3.2. Fixed Overwriting Buffers.- 3.3. Alternating Buffers.- 3.4. Dynamic Buffers.- 3.5. Mixed Schemes.- 3.6. How Much? How Big?.- 3.7. Alert and Control.- 4. Queues.- 4.1. Why Queues?.- 4.2. Where and What.- 4.3. Dedicated Systems and Generalized Systems Queues.- 4.4. Queue Arrangements-Some Examples.- 4.5. Queue Length.- 4.6. Priorities and Queues.- 4.7. Queue Storage and Overflow.- 5. File Management.- 5.1. Basic Problems.- 5.2. File Structures.- 5.3. File Control.- 6. Communications.- 6.1. General Objectives and Elements.- 6.2. Lines and Signaling.- 6.3. Message Structure.- 6.4. Input.- 6.5. Header Analysis.- 6.6. Storage.- 6.7. Address Analysis and Routing.- 6.8. Message Exchange.- 6.9. Output.- 6.10. Channel Coordination and Signaling.- 6.11. Retrieval.- 6.12. Operations and Controls.- 6.13. Standardization.- 7. Summary.- 8. Problems.- 9. References.- 11 Viability.- 1. Synopsis.- 2. Basic Concepts.- 2.1. The Components of Viability.- 2.2. A Philosophy for Viability Design.- 2.3. Graceful Degradation.- 2.4. Definitions.- 3. The Measure of Viability.- 3.1. Mean Time between Failures.- 3.2. Mean Time to Repair.- 3.3. Availability.- 3.4. Performance and Penalties.- 3.5. The Performance-Probability Plot.- 3.6. The Cumulative Performance-Probability Plot.- 3.7. Examples of Systems.- 4. The Achievement of Viability.- 4.1. Reliability.- 4.2. Maintainability.- 5. Malfunction Detection.- 5.1. Malfunction Indicators.- 5.2. Malfunction Detection Hardware.- 6. Failure Isolation.- 6.1. Test Programs.- 6.2. Diagnostic Programs.- 6.3. Hardware Aids to Test and Diagnostic Programs.- 7. Repair and Test Facilities.- 8. Spares Provisioning.- 9. Self-Repair.- 9.1. Reflexive Systems.- 9.2. Self-Failure Detecting Systems.- 9.3. Self-Diagnostic Systems.- 9.4. Self-Repairing Systems.- 9.5. Beyond Self-Repair.- 9.6. How Far and Whereto?.- 10. Graceful Degradation.- 10.1. Partition and the Domain of Sacrifice.- 10.2. Sacrifice Regimes.- 10.3. Implementation.- 11. Overdesign.- 12. Exchangeability.- 13. Redundancy.- 14. Summary.- 15. Problems.- 16. References.- 12 Viability Design.- 1. Synopsis.- 2. The Design Components of Viability.- 3. Executive Malfunction Detection.- 3.1. Self-Detection.- 3.2. External Detection.- 3.3. Periodic Checks-Rationale and Implementation.- 3.4. The Monitor.- 3.5. Poisoning.- 4. Executive Assignment.- 4.1. Physical vs. Functional Assignment.- 4.2. When to Assign.- 4.3. Viability Processors in Review.- 5. The Configuration Switching Network and Reconfiguration.- 5.1. Partition, Similarity, and Payoff.- 5.2. Configuration Switching Network Requirements.- 5.3. Configuration Switching Implementation.- 5.4. Configuration Controls.- 5.5. Reconfiguration Algorithm.- 5.6. Configuration Tables.- 5.7. Configuration Displays.- 5.8. Upgrade and Downgrade Configuration Changes.- 5.9. Other Uses of the Configuration Switching Network.- 6. Partition and the Configuration Switching Network.- 6.1. General.- 6.2. Configuration Switching Networks.- 7. The Ledger.- 7.1. The Ledger-Why and How.- 7.2. Roll-Off Implementation.- 7.3. The Content of the Ledger.- 7.4. Ledger Implementation.- 7.5. Ledger Protection.- 7.6. Roll-Off Order.- 8. Recovery.- 8.1. Recovery.- 8.2. Job Recovery Schedules.- 8.3. Roll-Back.- 8.4. Upgrade Recovery.- 8.5. Recovery in Perspective.- 9. Summary.- 10. Problems.- 11. References.- 13 System Analysis.- 1. Synopsis.- 2. Timing Analysis-General.- 2.1. Goals, Limits, and Approach.- 3. Timing Analysis.- 3.1. Contentious Transfers.- 3.2. Interrupts.- 3.3. Non-Base-Sequence Programs.- 3.4. Input-Dependent Queues and Probabilities.- 3.5. Cycle-Dependent and Mixed Probabilities.- 3.6. The Base-Sequence Program.- 3.7. Summing Up and Solving.- 3.8. Nonlinear Load Dependencies.- 3.9. Cycle Length, Delay, and Computer Loading.- 3.10. Burst Conditions.- 3.11. Parametric Analysis.- 4. Evaluation of Ledger Contribution.- 4.1. Subsumable, Unsubsumable, and Partially Subsumable Functions.- 4.2. Ledger Analysis.- 5. Queues, Stretch, and Delay.- 5.1. The Stretch Factor.- 5.2. Queues and Delays.- 6. Viability Calculations.- 6.1. Introduction.- 6.2. Unit Statistics.- 6.3. States and Metastates.- 6.4. Basic Approach.- 6.5. State and Metastate Probability.- 6.6. Metastate Arithmetic.- 6.7. Time in Metastates.- 7. Summary.- 8. Problems.- 9. References.- 14 Implementation.- 1. Synopsis.- 2. The Procurement Cycle.- 2.1. The Procurement Cycle.- 2.2. Procurement Policies.- 2.3. Disbursement of Responsibilities.- 2.4. Who Pays?.- 3. The Construction Cycle.- 3.1. Sites and Facilities.- 3.2. Site Preparation, Packing, and Shipping.- 3.3. Hardware Schedules and Development.- 4. System Cut-Over.- 4.1. Pre-existing Conditions.- 4.2. Phasing Problems.- 5. Personnel.- 5.1. The Architect.- 5.2. Systems Engineers.- 5.3. System Analysts.- 5.4. Electrical and Electronic Engineers.- 5.5. Programmers.- 5.6. Logic Designers.- 5.7. Mathematical Analysts.- 5.8. Administrative Personnel.- 5.9. Production Personnel.- 5.10. Site and Installation Engineers.- 5.11. Operators.- 5.12. Maintenance Technicians.- 5.13. Editors, Writers, and Teachers.- 5.14. Support Personnel.- 6. Project Management and Control.- 6.1. Schedules.- 6.2. Critical Path Methods.- 6.3. Project Controls.- 7. The Complex in Retrospect.- 8. Problems.- 9. References.


Best Sellers


Product Details
  • ISBN-13: 9781468429510
  • Publisher: Springer-Verlag New York Inc.
  • Publisher Imprint: Springer-Verlag New York Inc.
  • Height: 229 mm
  • No of Pages: 453
  • Series Title: English
  • Sub Title: Volume 2
  • Width: 152 mm
  • ISBN-10: 1468429515
  • Publisher Date: 07 Jun 2013
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Spine Width: 25 mm
  • Weight: 714 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
The Architecture and Engineering of Digital Computer Complexes: Volume 2
Springer-Verlag New York Inc. -
The Architecture and Engineering of Digital Computer Complexes: Volume 2
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

The Architecture and Engineering of Digital Computer Complexes: Volume 2

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA