| LDR | | 05709cam a2200709Ii 4500 |
| 001 | | 000000411401 |
| 005 | | 20190131142145 |
| 006 | | m d |
| 007 | | cr cnu---unuuu |
| 008 | | 180808s2018 mau ob 001 0 eng d |
| 020 | |
▼a 9780262346498
▼q (electronic bk.) |
| 020 | |
▼a 0262346494
▼q (electronic bk.) |
| 020 | |
▼z 9780262037938
▼q (hardcover) |
| 020 | |
▼z 0262037939
▼q (hardcover) |
| 035 | |
▼a 1866047
▼b (N$T) |
| 035 | |
▼a (OCoLC)1048003504 |
| 040 | |
▼a N$T
▼b eng
▼e rda
▼e pn
▼c N$T
▼d EBLCP
▼d YDX
▼d CNCGM
▼d MERUC
▼d OCLCQ
▼d OTZ
▼d BNG
▼d 247004 |
| 050 | 4 |
▼a QA76
▼b .D396 2018eb |
| 072 | 7 |
▼a COM
▼x 013000
▼2 bisacsh |
| 072 | 7 |
▼a COM
▼x 014000
▼2 bisacsh |
| 072 | 7 |
▼a COM
▼x 018000
▼2 bisacsh |
| 072 | 7 |
▼a COM
▼x 067000
▼2 bisacsh |
| 072 | 7 |
▼a COM
▼x 032000
▼2 bisacsh |
| 072 | 7 |
▼a COM
▼x 037000
▼2 bisacsh |
| 072 | 7 |
▼a COM
▼x 052000
▼2 bisacsh |
| 082 | 04 |
▼a 004
▼2 23 |
| 100 | 1 |
▼a Day, Mark Stuart,
▼e author. |
| 245 | 10 |
▼a Bits to bitcoin :
▼b how our digital stuff works/
▼c Mark Stuart Day ; illustrated by C.A. Jennings. |
| 260 | |
▼a Cambridge, MA:
▼b MIT Press,
▼c [2018]. |
| 300 | |
▼a 1 online resource. |
| 336 | |
▼a text
▼b txt
▼2 rdacontent |
| 337 | |
▼a computer
▼b c
▼2 rdamedia |
| 338 | |
▼a online resource
▼b cr
▼2 rdacarrier |
| 500 | |
▼a Includes index. |
| 505 | 0 |
▼a 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. |
| 505 | 8 |
▼a 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. |
| 505 | 8 |
▼a 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. |
| 505 | 8 |
▼a 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. |
| 505 | 8 |
▼a 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. |
| 520 | |
▼a An accessible guide to our digital infrastructure, explaining the basics of operating systems, networks, security, and other topics for the general reader. |
| 588 | |
▼a Description based on print version record. |
| 590 | |
▼a Master record variable field(s) change: 050 |
| 650 | 0 |
▼a Computer science
▼v Popular works. |
| 650 | 7 |
▼a COMPUTERS
▼x Computer Literacy.
▼2 bisacsh |
| 650 | 7 |
▼a COMPUTERS
▼x Computer Science.
▼2 bisacsh |
| 650 | 7 |
▼a COMPUTERS
▼x Data Processing.
▼2 bisacsh |
| 650 | 7 |
▼a COMPUTERS
▼x Hardware
▼x General.
▼2 bisacsh |
| 650 | 7 |
▼a COMPUTERS
▼x Information Technology.
▼2 bisacsh |
| 650 | 7 |
▼a COMPUTERS
▼x Machine Theory.
▼2 bisacsh |
| 650 | 7 |
▼a COMPUTERS
▼x Reference.
▼2 bisacsh |
| 650 | 7 |
▼a Computer science.
▼2 fast
▼0 (OCoLC)fst00872451 |
| 655 | 4 |
▼a Electronic books. |
| 655 | 7 |
▼a Popular works.
▼2 fast
▼0 (OCoLC)fst01423846 |
| 700 | 1 |
▼a Jennings, C. A.,
▼e illustrator, |
| 776 | 08 |
▼i Print version:
▼a Day, Mark Stuart.
▼t Bits to bitcoin.
▼d Cambridge, MA : MIT Press, [2018]
▼z 9780262037938
▼w (DLC) 2017046504
▼w (OCoLC)1015258699 |
| 856 | 40 |
▼3 EBSCOhost
▼u http://libproxy.dhu.ac.kr/_Lib_Proxy_Url/http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=1866047 |
| 938 | |
▼a EBL - Ebook Library
▼b EBLB
▼n EBL5489323 |
| 938 | |
▼a EBSCOhost
▼b EBSC
▼n 1866047 |
| 938 | |
▼a YBP Library Services
▼b YANK
▼n 15632085 |
| 990 | |
▼a ***1012033 |
| 994 | |
▼a 92
▼b N$T |