ACM SIGMETRICS and Performance ... International Conference on Measurement and Modelling, Proceedings
Author:
Publisher:
Published: 1990
Total Pages: 302
ISBN-13:
DOWNLOAD EBOOKPosts
Performance Evaluation of Computer and Communication Systems
Author: Lorenzo Donatiello
Publisher: Springer Science & Business Media
Published: 1993-09-15
Total Pages: 692
ISBN-13: 9783540572978
DOWNLOAD EBOOKThis volume contains the complete set of tutorial papers presented at the 16th IFIP (International Federation for Information Processing) Working Group 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation, and a number of tutorial papers presented at the 1993 ACM (Association for Computing Machinery) Special Interest Group METRICS Conference on Measurement and Modeling of Computer Systems. The principal goal of the volume is to present an overview of recent results in the field of modeling and performance evaluation of computer and communication systems. The wide diversity of applications and methodologies included in the tutorials attests to the breadth and richness of current research in the area of performance modeling. The tutorials may serve to introduce a reader to an unfamiliar research area, to unify material already known, or simply to illustrate the diversity of research in the field. The extensive bibliographies guide readers to additional sources for further reading.
Computer Networks and Systems: Queueing Theory and Performance Evaluation
Author: Thomas G. Robertazzi
Publisher: Springer Science & Business Media
Published: 2012-12-06
Total Pages: 310
ISBN-13: 1468403850
DOWNLOAD EBOOKStatistical performance evaluation has assumed an increasing amount of importance as we seek to design more and more sophisticated communi cation and information processing systems. The ability to predict a pro posed system's performance without actually having to construct it is an extremely cost effective design tool. This book is meant to be a first year graduate level introduction to the field of statistical performance evaluation. As such, it covers queueing theory (chapters 1-4) and stochastic Petri networks (chapter 5). There is a short appendix at the end of the book which reviews basic probability theory. At Stony Brook, this material would be covered in the second half of a two course sequence (the first half is a computer networks course using a text such as Schwartz's Telecommunications Networks). Students seem to be encouraged to pursue the analytical material of this book if they first have some idea of the potential applications. I am grateful to B.L. Bodnar, J. Blake, J.S. Emer, M. Garrett, W. Hagen, Y.C. Jenq, M. Karol, J.F. Kurose, S.-Q. Li, A.C. Liu, J. McKenna, H.T. Mouftah and W.G. Nichols, I.Y. Wang, the IEEE and Digital Equip ment Corporation for allowing previously published material to appear in this book.
Encyclopedia of Microcomputers
Author: Allen Kent
Publisher: CRC Press
Published: 1993-11-18
Total Pages: 402
ISBN-13: 9780824727116
DOWNLOAD EBOOK"The Encyclopedia of Microcomputers serves as the ideal companion reference to the popular Encyclopedia of Computer Science and Technology. Now in its 10th year of publication, this timely reference work details the broad spectrum of microcomputer technology, including microcomputer history; explains and illustrates the use of microcomputers throughout academe, business, government, and society in general; and assesses the future impact of this rapidly changing technology."
Advances in Computers
Author:
Publisher: Academic Press
Published: 1990-11-16
Total Pages: 417
ISBN-13: 0080566634
DOWNLOAD EBOOKAdvances in Computers
Job Scheduling Strategies for Parallel Processing
Author: Dror G. Feitelson
Publisher: Springer Science & Business Media
Published: 1996-10-16
Total Pages: 306
ISBN-13: 9783540618645
DOWNLOAD EBOOKThis book constitutes the strictly refereed post-workshop proceedings of the International Workshop on Job Scheduling Strategies for Parallel Processing, held in conjunction with IPPS '96 symposium in Honolulu, Hawaii, in April 1996. The book presents 15 thoroughly revised full papers accepted for inclusion on the basis of the reports of at least five program committee members. The volume is a highly competent contribution to advancing the state-of-the-art in the area of job scheduling for parallel supercomputers. Among the topics addressed are job scheduler, workload evolution, gang scheduling, multiprocessor scheduling, parallel processor allocation, and distributed memory environments.
Stochastic Analysis of Computer and Communication Systems
Author: Hideaki Takagi
Publisher: North Holland
Published: 1990
Total Pages: 880
ISBN-13:
DOWNLOAD EBOOKAnalytical techniques for evaluating the performance of computer and communication systems have evolved hand in hand with the progress in these systems since the late 1960's, and an enormous amount of knowledge has been accumulated in this interplay of applied mathematics and computer science. This book includes nineteen lengthy surveys of the state of the art of performance evaluation techniques, and an extensive bibliography. The topics include stochastic processes and queueing theory applied to performance analysis, and performance models of computer systems and communication networks. Articles have been contributed by leading scientists from five continents.
Performance Tools and Applications to Networked Systems
Author: Maria Carla Calzarossa
Publisher: Springer
Published: 2004-04-05
Total Pages: 394
ISBN-13: 3540246630
DOWNLOAD EBOOKThis book presents revised versions of tutorial lectures given at the IEEE/CS Symposium on modeling, analysis, and simulation of computer and telecommunication systems held in Orlando, FL, USA in October 2003. The lectures are grouped into three parts on performance and QoS of modern wired and wireless networks, current advances in performance modeling and simulation, and other specific applications of these methodologies. This tutorial book is targeted to both practitioners and researchers. The practitioner will benefit from numerous pointers to performance and QoS issues; the pedagogical style and plenty of references will be of great use in solving practical problems. The researcher and advanced student are offered a representative set of topics not only for their research value but also for their novelty and use in identifying areas of active research.
Shared Memory Multiprocessing
Author: Norihisa Suzuki
Publisher: MIT Press
Published: 1992
Total Pages: 534
ISBN-13: 9780262193221
DOWNLOAD EBOOKShared memory multiprocessors are becoming the dominant architecture for small-scale parallel computation. This book is the first to provide a coherent review of current research in shared memory multiprocessing in the United States and Japan. It focuses particularly on scalable architecture that will be able to support hundreds of microprocessors as well as on efficient and economical ways of connecting these fast microprocessors. The 20 contributions are divided into sections covering the experience to date with multiprocessors, cache coherency, software systems, and examples of scalable shared memory multiprocessors.
Accessing Replicated Data in a Large-scale Distributed System
Author: Richard Andrew Golding
Publisher:
Published: 1991
Total Pages: 260
ISBN-13:
DOWNLOAD EBOOKAbstract: "Replicating a data object improves the availability of the data, and can improve access latency by locating copies of the object near to their use. When accessing replicated objects across an internetwork, the time to access different replicas is non-uniform. Further, the probability that a particular replica is inaccessible is much higher in an internetwork than in a local-area network (LAN) because of partitions and the many intermediate hosts and networks that can fail. We report three replica-accessing algorithms which can be tuned to minimize either access latency or the number of messages sent. These algorithms assume only an unreliable datagram mechanism for communicating with replicas. Our work extends previous investigations into the performance of replication algorithms by assuming unreliable communication. We have investigated the performance of these algorithms by measuring the communication behavior of the Internet, and by building discrete-event simulations based on our measurements. We find that almost all message failures are either transient or due to long-term host failure, so that retrying messages a few times adds only a small amount to the overall message traffic while improving both access latency as long as the probability of message failure is small. Moreover, the algorithms which retry messages on failure provide significantly improved availability over those which do not."
