Snip
|
Optimal disk I/O with parallel block transfer
|
|---|
Categories |
|
|---|
For Snip |
loading snip actions ... |
|---|---|
For Page |
loading url actions ... |
| Optimal disk I/O with parallel block transfer | ||
| Full text |
 Pdf
(1.04 MB)
|
|
| Source |
Annual ACM Symposium on Theory of Computing
archive Proceedings of the twenty-second annual ACM symposium on Theory of computing table of contents
Baltimore, Maryland, United States
Pages: 159 - 169
Year of Publication: 1990
ISBN:0-89791-361-2
|
|
| Authors | ||
| Sponsor |
SIGACT:
ACM Special Interest Group on Algorithms and Computation Theory
|
|
| Publisher |
ACM Press
New York, NY, USA | |
HTML |
<tr><td class="medium-text" colspan="3"><strong>Optimal disk I/O with parallel block transfer</strong></td> </tr> <tr valign="middle"> </tr> <tr valign="top"> <td class="small-text"><strong>Full text</strong></td> <td class="smaller-text" colspan="2"> <a name="FullText" href="ft_gateway.cfm?id=100234&type=pdf&coll=GUIDE&dl=GUIDE&CFID=17850181&CFTOKEN=14673189" target="_blank"><img src="http://portal.acm.org/images/pdf_logo.gif" alt="pdf format" align="texttop" border="0" height="16" hspace="1" width="16">Pdf</a> (1.04 MB) </td> </tr> <tr valign="top"> <td class="small-text"><strong>Source</strong></td> <td class="small-text" colspan="2"> <span class="mediumb-text">Annual ACM Symposium on Theory of Computing</span> <a href="toc.cfm?id=SERIES396&type=series&coll=GUIDE&dl=GUIDE&CFID=17850181&CFTOKEN=14673189" target="_self" class="small-link-text">archive</a><br> <span class="mediumb-text">Proceedings of the twenty-second annual ACM symposium on Theory of computing </span> <a href="toc.cfm?id=100216&type=proceeding&coll=GUIDE&dl=GUIDE&CFID=17850181&CFTOKEN=14673189" target="_self" class="small-link-text">table of contents</a><br> <div class="small-text"> Baltimore, Maryland, United States </div> <div class="medium-text"> </div> <div class="small-text"> Pages: 159 - 169 </div> <div class="small-text"> Year of Publication: 1990 </div> <div class="small-text"> ISBN:0-89791-361-2 </div> </td> </tr> <tr valign="top"> <td class="small-text"> <strong>Authors</strong> </td> <td colspan="2"> <div class="authors"> <table cellpadding="0" cellspacing="0"> <tbody><tr> <td class="small-text"> <a href="results.cfm?query=author%3AJ%2E%20S%2E%20Vitter&querydisp=author%3AJ%2E%20S%2E%20Vitter&coll=GUIDE&dl=GUIDE&CFID=17850181&CFTOKEN=14673189" target="_self">J. S. Vitter</a> </td> <td class="small-text"> <small> Dept. of Computer Science, Brown University, Providence, R.I.</small> </td> </tr> <tr> <td class="small-text"> <a href="results.cfm?query=author%3AE%2E%20A%2E%20M%2E%20Shriver&querydisp=author%3AE%2E%20A%2E%20M%2E%20Shriver&coll=GUIDE&dl=GUIDE&CFID=17850181&CFTOKEN=14673189" target="_self">E. A. M. Shriver</a> </td> <td class="small-text"> <small> Bell Communications Research, 444 Hoes Lane, Piscataway, N.J.</small> </td> </tr> </tbody></table> </div> </td> </tr> <tr valign="top"> <td class="small-text"><strong>Sponsor </strong></td> <td colspan="2"> <div class="sponsors"> <a href="%20http://www.acm.org/sigact/" target="sponsor" title="Sponsor">SIGACT</a>: ACM Special Interest Group on Algorithms and Computation Theory <br> </div> </td> </tr> <tr valign="top"> <td class="small-text"><strong>Publisher</strong></td> <td colspan="2"> <div class="publishers"> ACM Press <small> New York, NY, USA</small></div></td></tr> |
|---|
