รายละเอียดในรูปแบบ MARC
| 000 -LEADER |
|---|
| fixed length control field |
03929cam a2200313 i 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
32358 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20230423231424.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
140909s2013 enka b 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781107027503 (hardback) |
| 049 ## - LOCAL HOLDINGS (OCLC) |
|---|
| -- |
PITLIB |
| 050 00 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.545 |
| Item number |
.H37 2013 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Harchol-Balter, Mor, |
| Dates associated with a name |
1966- |
| 9 (RLIN) |
41970 |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Performance modeling and design of computer systems : |
| Remainder of title |
queueing theory in action / |
| Statement of responsibility, etc. |
Mor Harchol-Balter, Carnegie Mellon University, Pennsylvania |
| Medium |
[book] |
| 260 #1 - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Cambridge : |
| Name of publisher, distributor, etc. |
Cambridge University Press, |
| Date of publication, distribution, etc. |
2013. |
| -- |
4065 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xxiii, 548 pages : |
| Other physical details |
illustrations |
| 449 #0 - |
|---|
| -- |
•u005– New Arrivals- Sep. 2014 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references (pages 531-539) and index |
| 505 8# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Machine generated contents note: Part I. Introduction to Queueing: 1. Motivating examples; 2. Queueing theory terminology; Part II. Necessary Probability Background: 3. Probability review; 4. Generating random variables; 5. Sample paths, convergence, and averages; Part III. The Predictive Power of Simple Operational Laws: 'What If' Questions and Answers; 6. Operational laws; 7. Modification analysis; Part IV. From Markov Chains to Simple Queues: 8. Discrete-time Markov Chains; 9. Ergodicity theory; 10. Real-world examples: Google, Aloha; 11. Generating functions for Markov Chains; 12. Exponential distributions and Poisson Process; 13. Transition to continuous-time Markov Chains; 14. M/M/1 and PASTA; Part V. Server Farms and Networks: Multi-server, Multi-queue Systems: 15. Server farms: M/M/k and M/M/k/k; 16. Capacity provisioning for server farms; 17. Time-reversibility and Burke's Theorem; 18. Jackson network of queues; 19. Classed network of queues; 20. Closed networks of queues; Part VI. Real-World Workloads: High-Variability and Heavy Tails: 21. Tales of tails: real-world workloads; 22. Phase-type workloads and matrix-analytic; 23. Networks of time-sharing (PS) servers; 24. M/G/I queue and inspection paradox; 25. Task assignment for server farms; 26. Transform analysis; 27. M/G/I transform analysis; 28. Power optimization application; Part VII. Smart Scheduling: 29. Performance metrics; 30. Non-preemptive, non-size-based policies; 31. Preemptive, non-size-based policies; 32. Non-preemptive, size-based policies; 33. Preemptive, size-based policies; 34. Scheduling: SRPT and fairness |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
"Computer systems design is full of conundrums. Tackling the questions that systems designers care about, this book brings queueing theory decisively back to computer science. The book is written with computer scientists and engineers in mind and is full of examples from computer systems, as well as manufacturing and operations research. Fun and readable, the book is highly approachable, even for undergraduates, while still being thoroughly rigorous and also covering a much wider span of topics than many queueing books. Readers benefit from a lively mix of motivation and intuition, with illustrations, examples and more than 300 exercises - all while acquiring the skills needed to model, analyze and design large-scale systems with good performance and low cost. The exercises are an important feature, teaching research-level counterintuitive lessons in the design of computer systems. The goal is to train readers not only to customize existing analyses but also to invent their own"-- |
| Assigning source |
Provided by publisher. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Transaction systems (Computer systems) |
| General subdivision |
Mathematical models. |
| 9 (RLIN) |
20860 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computer systems |
| General subdivision |
Mathematics. |
| -- |
Mathematics. |
| 9 (RLIN) |
41971 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Queuing theory. |
| 9 (RLIN) |
41972 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Queuing networks (Data transmission) |
| 9 (RLIN) |
41973 |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
COMPUTERS / General. |
| Source of heading or term |
bisacsh |
| 9 (RLIN) |
41974 |
| 690 #0 - LOCAL SUBJECT ADDED ENTRY--TOPICAL TERM (OCLC, RLIN) |
|---|
| Topical term or geographic name as entry element |
0023 วิศวกรรมศาสตรบัณฑิต สาขาวิศวกรรมคอมพิวเตอร์ CPE (ป.ตรี) |
| 9 (RLIN) |
65 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
หนังสือ |
| 988 ## - |
|---|
| -- |
32358 |
