Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Sanders, Peter

dblp



Editor(s):

Wiedermann, J.
van Emde Boas, P.
Nielsen, Mogens

dblp
dblp
dblp



BibTeX cite key*:

San99c

Title, Booktitle

Title*:

Accessing Multiple Sequences Through Set Associative Caches

Booktitle*:

Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99)

Event, URLs

URL of the conference:

http://www.uivt.cas.cz/ICALP99/

URL for downloading the paper:


Event Address*:

Prague, Czech Republic

Language:

English

Event Date*
(no longer used):

July, 11-15

Organization:

EATCS

Event Start Date:

16 September 2019

Event End Date:

16 September 2019

Publisher

Name*:

Springer

URL:


Address*:

Berlin

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

1644

Number:


Month:


Pages:

655-664

Year*:

1999

VG Wort Pages:


ISBN/ISSN:

3-540-66224-3

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

The cache hierarchy prevalent in todays high performance processors
has to be taken into account in order to design algorithms which
perform well in practice. We start from the empirical observation
that external memory algorithms often turn out to be good algorithms
for cached memory. This is not self evident since caches have a fixed
and quite restrictive algorithm choosing the content of the cache. We
investigate the impact of this restriction for the frequently
occurring case of access to multiple sequences. We show that any
access pattern to $k=\Th{M/B^{1+1/a}}$ sequential data streams can be
efficiently supported on an $a$-way set associative cache with
capacity $M$ and line size $B$. The bounds are tight up to lower
order terms.

Keywords:

Set associative cache, external memory algorithm, memory hierarchy, multi merge

HyperLinks / References / URLs:

http://www.mpi-sb.mpg.de/~sanders/papers/index.html



Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat



BibTeX Entry:

@INPROCEEDINGS{San99c,
AUTHOR = {Sanders, Peter},
EDITOR = {Wiedermann, J. and van Emde Boas, P. and Nielsen, Mogens},
TITLE = {Accessing Multiple Sequences Through Set Associative Caches},
BOOKTITLE = {Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99)},
PUBLISHER = {Springer},
YEAR = {1999},
ORGANIZATION = {EATCS},
VOLUME = {1644},
PAGES = {655--664},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Prague, Czech Republic},
ISBN = {3-540-66224-3},
}


Entry last modified by Uwe Brahm, 03/02/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Peter Sanders
Created
02/23/2000 05:52:34 PM
Revisions
3.
2.
1.
0.
Editor(s)
Uwe Brahm
Anja Becker
Anja Becker
Peter Sanders
Edit Dates
01/25/2001 08:38:09 PM
07.04.2000 10:06:07
29.03.2000 16:32:34
23/02/2000 17:52:34