A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort

Full text

Pdf (411 KB)

Source

Journal of the ACM (JACM) archive
Volume 26 , Issue 1 (January 1979) table of contents

Pages: 58 - 64

Year of Publication: 1979

ISSN:0004-5411

Authors

Zvi Galil	Department of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel
Nimrod Megiddo	Department of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel and Graduate School of Management, Northwestern University, Evanston, IL

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 43, Citation Count: 17

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/322108.322114 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	BLOM, M, FLOYD, R W, PRATT, V R, RIVEST, R L, AND TAR JAN, R E Time bounds for selecuon J Comptr Syst Scz 7(1972), 448-461
	3	CHARNES, A, AND COOPER, W W The theory of search Optimal distribution of effort Manage Set 5 (1958), 44-49
	4	DE GUE/qr~I, J Optimum distribution of effort An extension of the Koopman basic theory J ORSA 9 (1961), 1-7
	5	Fox, B L Discrete opttrnlzatlon via marginal analysis Manage Sct 13 (1966), 210-216
	6	B. L. Fox, Accelerating List Processing in Discrete Programming, Journal of the ACM (JACM), v.17 n.2, p.383-384, April 1970 [doi>10.1145/321574.321590]
	7	Fox, B L, AND LAND1, D.M Searching for the mulupher in one constraint optimization problems Oper Res 18 (1970), 253-262.
	8	GROSS, O Class of discrete type minimization problems RM-1644, Rand Corp, Santa Momca, Cahf, Feb 1956
	9	KARUSH, W A queuing model for an inventory problem J ORSA 5 (1957), 693-703
	10	KARUSH, W A general algorithm for the optimal distribution of effort Manage Sct 9 (1962), 50-72
	11	KOOPMAN, B O The optunum distribution of effort J ORSA 1 (1953) 52-63
	12	Luss, H, AND GUPTA, S K Allocation of effort resources among competitive acttvmes Oper Res 23 (1975), 360-366
	13	SAAT~, T.L Opnmtzatton m lntegers and Related Extremal Problems McGraw-Hill, New York, p 184
	14	WILKINSON, C, AND GUPTA, S K Allocating promotional effort to competing activities A dynamic programmmg approach International Federation of Operations Research Socs Conf, Vemce, 1969, pp 419- 432

CITED BY 17

	Joel L. Wolf , Philip S. Yu , Hadas Shachnai, DASD dancing: a disk load balancing optimization scheme for video-on-demand computer systems, ACM SIGMETRICS Performance Evaluation Review, v.23 n.1, p.157-166, May 1995
	Marek Chrobak , David Eppstein , Giuseppe F. Italiano , Moti Yung, Efficient sequential and parallel algorithms for computing recovery points in trees and paths, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.158-167, January 28-30, 1991, San Francisco, California, United States
	Joel L. Wolf , Philip S. Yu, On balancing the load in a clustered web farm, ACM Transactions on Internet Technology (TOIT), v.1 n.2, p.231-261, November 2001
	Zhen Liu , Mark S. Squillante , Joel L. Wolf, On maximizing service-level-agreement profits, Proceedings of the 3rd ACM conference on Electronic Commerce, p.213-223, October 14-17, 2001, Tampa, Florida, USA
	Joel L. Wolf , Daniel M. Dias , Philip S. Yu, An effective algorithm for parallelizing sort merge joins in the presence of data skew, Proceedings of the second international symposium on Databases in parallel and distributed systems, p.103-115, July 02-04, 1990, Dublin, Ireland
	Greg N. Frederickson , Donald B. Johnson, Generalized selection and ranking (Preliminary Version), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.420-428, April 28-30, 1980, Los Angeles, California, United States
	John Turek , Joel L. Wolf , Krishna R. Pattipati , Philip S. Yu, Scheduling parallelizable tasks: putting it all on the shelf, ACM SIGMETRICS Performance Evaluation Review, v.20 n.1, p.225-236, June 1992
	Joel L. Wolf , Philip S. Yu , Hadas Shachnai, Disk load balancing for video-on-demand systems, Multimedia Systems, v.5 n.6, p.358-370, Dec. 1997
	J. L. Wolf , D. M. Dias , P. S. Yu , J. Turek, New Algorithms for Parallelizing Relational Database Joins in the Presence of Data Skew, IEEE Transactions on Knowledge and Data Engineering, v.6 n.6, p.990-997, December 1994
	J. L. Wolf , D. M. Dias , P. S. Yu, A Parallel Sort Merge Join Algorithm for Managing Data Skew, IEEE Transactions on Parallel and Distributed Systems, v.4 n.1, p.70-86, January 1993
	Nimrod Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms, Journal of the ACM (JACM), v.30 n.4, p.852-865, Oct. 1983
	A. N. Tantawi , G. Towsley , J. Wolf, Optimal allocation of multiple class resources in computer systems, ACM SIGMETRICS Performance Evaluation Review, v.16 n.1, p.253-260, May 1988
	N. Katoh , T. Ibaraki , H. Mine, An Algorithm for the K Best Solutions of the Resource Allocation Problem, Journal of the ACM (JACM), v.28 n.4, p.752-764, Oct. 1981
	J. L. Wolf , M. S. Squillante , P. S. Yu , J. Sethuraman , L. Ozsen, Optimal crawling strategies for web search engines, Proceedings of the 11th international conference on World Wide Web, May 07-11, 2002, Honolulu, Hawaii, USA
	Harold S. Stone , John Turek , Joel L. Wolf, Optimal Partitioning of Cache Memory, IEEE Transactions on Computers, v.41 n.9, p.1054-1068, September 1992
	B. Abali , F. özgü , A. Bataineh, Balanced Parallel Sort on Hypercube Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, v.4 n.5, p.572-581, May 1993
	Bernard Chazelle, New techniques for computing order statistics in Euclidean space (extended abstract), Proceedings of the first annual symposium on Computational geometry, p.125-134, June 05-07, 1985, Baltimore, Maryland, United States