About This Issue . . . This issue contains two articles, one on trace-driven memory simulation, by Richard Uhlig and Trevor Mudge, and the other on approximately optimal solutions to some covering and packing problems by Vangelis Paschos. Trace-driven memory simulation is about simulating patterns of memory access to develop caching algorithms and other methods for reducing the discrepancy between memory and processing speeds. This comprehensive survey examines the accuracy, speed, memory, flexibility, expense, and ease of use of memory-simulation techniques â concluding that no single method is best and that changes in the content of traces are needed to simulate multiprocessing and distributed applications. This topic is part of the emerging area of input/output for large-scale computation that was one of the strategic directions in the December 1996 issue of Surveys. Covering a set C and a collection of subsets S is concerned with finding a (minimal) set of subsets of S whose union is the set C, while packing is about finding a maximum number of mutually disjoint subsets of S. This paper surveys approximation algorithms for set covering and packing, and related problems such as vertex cover, independent set, and clique, since exact algorithms are intractably hard. Though this paper is mathematically challenging, it provides insights pertinent to the relations among problems as well as some proofs simpler than those in the literature. The editors thank readers for their email on our two special 50th-anniversary issues. Readers wishing to express an opinion about either perspectives or strategic directions in computing are encouraged to write a letter or submit a two-page position statement to the editors. ACM Computing Surveys, Vol. 29, No. 2, June 1997
/lp/association-for-computing-machinery/editorial-leJOkxjDBb
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Free Article
Editorial
Wegner, Peter
Follow ACM Computing Surveys (CSUR)
, Volume 29 (2)
Association for Computing Machinery – Jun 1, 1997
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
