상세정보
Export to Refworks부가기능
Bits to bitcoin : how our digital stuff works
상세 프로파일
| 자료유형 | 단행본 |
|---|---|
| 서명/저자사항 | Bits to bitcoin : how our digital stuff works/ Mark Stuart Day ; illustrated by C.A. Jennings. |
| 개인저자 | Day, Mark Stuart,author. Jennings, C. A.,illustrator, |
| 발행사항 | Cambridge, MA: MIT Press, [2018]. |
| 형태사항 | 1 online resource. |
| 기타형태 저록 | Print version: Day, Mark Stuart. Bits to bitcoin. Cambridge, MA : MIT Press, [2018] 9780262037938 |
| ISBN | 9780262346498 0262346494 |
| 일반주기 |
Includes index.
|
| 내용주기 | Intro; Contents; Preface; Acknowledgments; 1. Introduction; I. Single Process; 2. Steps; Bits; Noise; Is Computation Physical?; Weighing Programs; Analog/Digital Conversion; Born Digital; 3. Processes; Reading as a Process; Turing Machines; Infinite Processes; Execution; Effective Construction; Hardware vs. Software; Uniformity Gives Speed; Moore's Law and Uniformity; 4. Names; What's in a Name?; Quoting; Sentence Patterns; Lambda; 5. Recursion; Factorial; The House That Jack Built; Finite and Infinite; 6. Limits: Imperfect Programs; All Software Is Flawed; Discrete States; Testing. Massive ScaleDoubling; Branching; Malleability; Making Things Worse; Requirements; Expressing Requirements; Specifications; Mock-ups; Implementation; 7. Limits: Perfect Programs; Environment; Big Problems; Computational Complexity; Ignoring Constants; Categories of Complexity; Uncomputability; Formal Logic; No Solution to Hilbert's Problem; Russell's Paradox; Halting vs. Diverging; Building a Paradox; The Halting Problem; II. Interacting Processes; 8. Coordination; Sharing a Book; Multiple Books and Multiple Readers; Deadlock; Gridlock; Detecting Deadlock; Breaking Deadlock; Livelock. Thrashing9. State, Change, and Equality; Stateless vs. Stateful; Assignment; Referential Transparency; Is State Necessary?; Two Kinds of Equal; Same Object vs. Different Object; 10. Controlled Access; Lost Update; Two Processes, in Detail; Interleaving; Multiprocessing and Multiprogramming; Some Example Interleavings; Is This a Real Problem?; Mutual Exclusion; Using a Lock; 11. Interrupts; The Unpredictable Environment; Check, Check, Check ... ; Interrupts and Handlers; Shared Services; Frequent Check, Rare Problem; Protecting Memory; System Calls; 12. Virtualization; Managing Storage. Virtual MemoryVirtual Addresses and Real Addresses; Virtual Machines; Sharing Servers; Building a Hypervisor; 13. Separation; Distributed Systems; Autonomy; Distance; Standards; Distance Revisited; Light Is Slow; Is Anyone There?; The Order of Events; Reaching Agreement; Heartbeats; Are Earth-Size Distances Small?; 14. Packets; Compression; Incompressible Data; 15. Browsing; Programs in Browsers; Naming Resources; Hierarchical Names; Shorter Names; Editing URLs; Naming Servers; Finding Servers; Caching; Talking to the Server; Structure vs. Presentation; Forms; Escaping; Searching Searches. III. Unstoppable Processes16. Failure; Reliability vs. Availability; Fail-Stop; Spares; Error Correction; Error Detection; Storage and Failure; Flash; Injury vs. Death; Logging vs. Replication; Stable Storage; RAID; Independent Failures?; Common-Mode Failure; Failure Rates; 17. Software Failure; Specifications Revisited; Consistent Comparison; Comparing Results; Byzantine Failure; 18. Reliable Networks; Guaranteed Delivery?; Redundant Messages; The End-to-End Principle; Acknowledgment and Retransmission; Multiple Acknowledgments and Negative Acknowledgments; Congestion Collapse. |
| 요약 | An accessible guide to our digital infrastructure, explaining the basics of operating systems, networks, security, and other topics for the general reader. |
| 일반주제명 | Computer science --Popular works. COMPUTERS --Computer Literacy. COMPUTERS --Computer Science. COMPUTERS --Data Processing. COMPUTERS --Hardware --General. COMPUTERS --Information Technology. COMPUTERS --Machine Theory. COMPUTERS --Reference. Computer science. |
| 언어 | 영어 |
| 바로가기 |  |
