Throughput optimization in disk-based real-time application specific systems
Stephen Docy,Inki Hong,Miodrag Potkonjak +2 more
- 06 Nov 1996
- pp 133-138
TL;DR: This work develops efficient optimization algorithms for data assignment on a single and multiple disks so that the seek time overhead is minimized and the importance of the synthesis problem and effectiveness of the proposed optimization algorithms are clear.
read more
Abstract: Traditionally, application specific computations have been focusing on numerically intensive data manipulation. Modern communications and DSP applications, such as WWW, and video-on-demand, however, are increasingly more data management oriented. At the same time, the technological trends indicate that magnetic disk system performance is rapidly becoming a principal component in overall system behavior. We initiate system level research in synthesis of disk-based application specific system by introducing cost and throughput optimization problems for synthesis of disk- based application specific systems. We formulate, establish computational complexity, and develop efficient optimization algorithms for data assignment on a single and multiple disks so that the seek time overhead is minimized. Extensive experimental results clearly indicate the importance of the synthesis problem and effectiveness of the proposed optimization algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
•Book
Computer Architecture: A Quantitative Approach
John L. Hennessy,David A. Patterson +1 more
- 01 Dec 1989
TL;DR: This best-selling title, considered for over a decade to be essential reading for every serious student and practitioner of computer design, has been updated throughout to address the most important trends facing computer designers today.
12.6K
Dataflow process networks
Edward A. Lee,T.M. Parks +1 more
- 01 May 1995
TL;DR: Dataflow process networks are shown to be a special case of Kahn process networks, a model of computation where a number of concurrent processes communicate through unidirectional FIFO channels, where writes to the channel are nonblocking, and reads are blocking.