Search for Author All Reviews
	Tay, Y     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 5 reviews       Analytical performance modeling for computer systems (3rd ed.) Tay Y., Morgan&Claypool Publishers, San Rafael, CA, 2018. 171 pp.  Type: Book (978-1-681733-89-0) Performance measurement and modeling is essential for both real systems and systems being modeled in a research environment. Without good models and tests to verify that the systems match those models, it can be very difficult indeed t...... Dec 17 2018     Locking performance in centralized databases Tay Y., Academic Press Prof., Inc., San Diego, CA, 1988.  Type: Book (9789780126844009) This book describes an analytic model for examining the performance of database concurrency control algorithms. While the book is accurate, thorough, and informative, I would not recommend it for the casual database user. The content i...... Mar 1 1989     A mean value performance model for locking in databases Tay Y., Suri R. (ed), Goodman N. Journal of the ACM 32(3): 618-651, 1985.  Type: Article Performance of locking in database systems is extremely important. We need only consider the airline reservation system to realize how important the problem is that these researchers have addressed. Such a database is very large, and i...... Mar 1 1986     Error bounds for performance prediction in queuing networks Tay Y., Suri R. (ed) ACM Transactions on Computer Systems 3(3): 227-254, 1985.  Type: Article Analytic models based on Closed Queueing Networks (CQN) are widely used for performance prediction in many systems such as computer systems, communication networks, and automated manufacturing plants. These models are subject to error ...... Dec 1 1985     GYO reductions, canonical connections, tree and cyclic schemas, and tree projections Goodman N., Shmueli O., Tay Y. Journal of Computer and System Sciences 29(3): 338-358, 1984.  Type: Article In this paper the authors consider finite sets and finite multisets in defining a database schema D. The results in this paper concern the Graham reduction [1] and tree schema. A qual graph for D... Jul 1 1985
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy