Benutzer:Wohingenau/Baustelle:Time-Memory Tradeoff
In der Informatik ist ein Time-Memory Tradeoff (deutsch Zeit-Speicher-Kompromiss oder Zeit-Speicher-Ausgleich) ein Kompromiss bei der der Speicherbedarf eines Programmes zugunsten einer längeren Laufzeit gesenkt wird oder umgekehrt die Laufzeit zugunsten eines höheren Speicherbedarf verkürzt wird. Ziel dabei ist es das Programm unter aktuellen technischen Vorraussetzungen möglichst effizient umzusetzen.
Beispiele
Lookup-Tabelle gegenüber Neuberechnung
Bei der Verwendung von Lookup-Tabelle kann in der Implementation die gesamte Tabelle vorberechnet werden, was die Laufzeit verringert, aber den Speicherbedarf erhöht.
Komprimierte Daten gegenüber Unkompremierte Daten
Ein Ausgleich zwischen Speicher und Laufzeit erfolgt bei der Datenkompression, bei dem der Speicherbedarf von Daten verringert wird, aber mehr Zeit aufgrund der Laufzeit des Kompressionsalgorithmus benötigt wird.
Re-rendering gegenüber gespeicherter Bilder
Werden auf den Servern der Wikipedia LaTeX-Formeln als Quelltext und nicht als Bilddatei gespeichert, so wird der Speicherbedarf gesenkt, aber durch dass wiederholte Rendern die Laufzeit erhöht.
kleiner Programmcode gegenüber loop unrolling
Durch auflösen von Schleifen wird die Laufzeit verkürzt, aber der Programmcode vergrößert.
Weitere Beispiele für Algorithmen
- Babystep-Giantstep-Algorithmus der für die Berechnung des diskreten Logarithmus verwendet wird.
- Rainbow Tabellen in der Kryptografie
- Dynamische Programmierung zur algorithmischen Lösung von Optimierungsproblemen
Weblinks
- Philippe Oechslin: Making a Faster Cryptanalytic Time-Memory Trade-Off.
- Once Upon a Time-Memory Tradeoff.
Übersetzungs-Info
Übersetzung von en:Space-time_tradeoff
* (cur) (prev) 16:46, 21 December 2009 SmackBot (talk | contribs) m (4,084 bytes) (Date maintenance tags and general fixes) (undo) * (cur) (prev) 10:44, 20 December 2009 81.129.35.252 (talk) (4,053 bytes) (.- →tidy up article with section headings etc) (undo) * (cur) (prev) 10:15, 20 December 2009 81.129.35.252 (talk) (3,850 bytes) (→improve introductuion) (undo) * (cur) (prev) 09:59, 20 December 2009 81.129.35.252 (talk) (3,848 bytes) (→See also add algorithmic efficiency) (undo) * (cur) (prev) 21:35, 26 April 2009 80.116.211.229 (talk) (3,819 bytes) (undo) * (cur) (prev) 18:00, 13 March 2009 Gwern (talk | contribs) (3,786 bytes) (full rv) (undo) * (cur) (prev) 21:59, 10 March 2009 98.231.216.230 (talk) (3,794 bytes) (undo) * (cur) (prev) 21:58, 10 March 2009 98.231.216.230 (talk) (3,830 bytes) (undo) * (cur) (prev) 14:16, 20 January 2009 190.55.16.7 (talk) (3,796 bytes) (Deleted a repeated word ("attack")) (undo) * (cur) (prev) 14:02, 8 December 2008 LokiClock (talk | contribs) m (3,803 bytes) (the plural of index is indices, not indexes) (undo) * (cur) (prev) 00:32, 3 November 2008 Synthebot (talk | contribs) m (3,790 bytes) (robot Removing: de:Space-time tradeoff) (undo) * (cur) (prev) 14:29, 27 October 2008 Thijs!bot (talk | contribs) m (3,817 bytes) (robot Adding: simple:Space-time tradeoff) (undo) * (cur) (prev) 03:03, 20 September 2008 Hegariz (talk | contribs) (3,786 bytes) (Removed external link which is non-authortative, not relevant, and does not even make sense.) (undo) * (cur) (prev) 03:00, 20 September 2008 Hegariz (talk | contribs) (3,884 bytes) (re-wrote paragraph on cryptography) (undo) * (cur) (prev) 02:29, 20 September 2008 Hegariz (talk | contribs) (3,362 bytes) (changed some words) (undo) * (cur) (prev) 02:26, 20 September 2008 Hegariz (talk | contribs) (3,362 bytes) (removed the word simple) (undo) * (cur) (prev) 02:26, 20 September 2008 Hegariz (talk | contribs) (3,369 bytes) (changed memory to space. The topic of computational space is an abstraction independent of both RAM and hard drive storage.) (undo) * (cur) (prev) 02:14, 20 September 2008 Hegariz (talk | contribs) (3,374 bytes) (→See also) (undo) * (cur) (prev) 01:47, 20 September 2008 Hegariz (talk | contribs) (3,350 bytes) (Added a see also) (undo) * (cur) (prev) 01:43, 20 September 2008 Hegariz (talk | contribs) (3,304 bytes) (Changed an incorrect statement which lacks citation.) (undo) * (cur) (prev) 22:26, 14 September 2008 SmackBot (talk | contribs) m (3,530 bytes) (Date maintenance tags and general fixes) (undo) * (cur) (prev) 11:19, 14 September 2008 Hegariz (talk | contribs) (3,512 bytes) (Questionable statement.) (undo) * (cur) (prev) 19:39, 25 August 2008 87.194.93.60 (talk) (3,329 bytes) (Made wiki link to discrete logarithms) (undo) * (cur) (prev) 12:08, 2 July 2008 198.208.240.251 (talk) (3,325 bytes) (undo) * (cur) (prev) 09:16, 28 January 2008 Intgr (talk | contribs) m (3,051 bytes) (revert test) (undo) * (cur) (prev) 02:04, 28 January 2008 77.190.121.163 (talk) (3,053 bytes) (undo) * (cur) (prev) 01:56, 28 January 2008 77.190.121.163 (talk) (3,054 bytes) (undo) * (cur) (prev) 16:22, 26 November 2007 129.27.203.28 (talk) (3,024 bytes) (undo) * (cur) (prev) 21:35, 30 October 2007 216.194.124.244 (talk) (2,890 bytes) (undo) * (cur) (prev) 20:06, 30 October 2007 Carnildo (talk | contribs) (2,885 bytes) (Revert unexplained change) (undo) * (cur) (prev) 17:51, 30 October 2007 64.69.127.128 (talk) (2,897 bytes) (undo) * (cur) (prev) 00:09, 21 October 2007 Oaf2 (talk | contribs) m (2,885 bytes) (add a note about a special case, probably should be a footnote instead.) (undo) * (cur) (prev) 09:06, 23 September 2007 Thijs!bot (talk | contribs) m (2,664 bytes) (robot Adding: es:Situación de compromiso espacio-tiempo) (undo) * (cur) (prev) 21:09, 5 September 2007 Kralizec! (talk | contribs) m (2,617 bytes) (revert vandalism by 172.202.132.52) (undo) * (cur) (prev) 19:59, 5 September 2007 172.202.132.52 (talk) (2,676 bytes) (undo) * (cur) (prev) 12:40, 25 June 2007 ST47 (talk | contribs) m (2,617 bytes) (Reverted 1 edit by 82.198.190.193 identified as vandalism to last revision by 205.201.141.146. using TW) (undo) * (cur) (prev) 12:39, 25 June 2007 82.198.190.193 (talk) (2,716 bytes) (→External links) (undo) * (cur) (prev) 18:43, 13 June 2007 205.201.141.146 (talk) (2,617 bytes) (Less self-referential) (undo) * (cur) (prev) 22:27, 2 June 2007 Wikidrone (talk | contribs) (2,561 bytes) (not a design pattern) (undo) * (cur) (prev) 16:29, 31 March 2007 210.2.231.93 (talk) (add a link to Japanese translation) (undo) * (cur) (prev) 16:54, 7 February 2007 SmackBot (talk | contribs) m (Date/fix maintenance tags) (undo) * (cur) (prev) 13:20, 5 February 2007 Intgr (talk | contribs) (undo) * (cur) (prev) 13:00, 5 February 2007 Intgr (talk | contribs) (Vorlage:Fact: Moore's Law beats hard disk space growth, AFAIK) (undo) * (cur) (prev) 19:30, 8 June 2006 Decrypt3 (talk | contribs) (rm irrelevant material, add example) (undo) * (cur) (prev) 22:44, 7 June 2006 JonHarder (talk | contribs) (rm broken and off-topic links; Sharpen category.) (undo) * (cur) (prev) 03:10, 26 May 2006 DevastatorIIC (talk | contribs) m (Fixed redirect) (undo) * (cur) (prev) 03:54, 24 February 2006 Carnildo (talk | contribs) (Revert test) (undo) * (cur) (prev) 10:30, 23 February 2006 202.41.85.2 (talk) (undo) * (cur) (prev) 01:58, 31 January 2006 Decrypt3 (talk | contribs) (undo) * (cur) (prev) 03:19, 21 January 2006 67.101.131.168 (talk) (undo) * (cur) (prev) 02:38, 22 December 2005 Gene.arboit (talk | contribs) (fr:) (undo) * (cur) (prev) 05:08, 5 December 2005 Interiot (talk | contribs) (stub sort: Vorlage:Comp-sci-stub) (undo) * (cur) (prev) 23:58, 4 December 2005 Antaeus Feldspar (talk | contribs) m (bypass redirect) (undo) * (cur) (prev) 09:00, 18 November 2005 Mixmatch (talk | contribs) (undo) * (cur) (prev) 08:57, 18 November 2005 Mixmatch (talk | contribs) (Added resources referencing the use of space-time tradoff in computer security.) (undo) * (cur) (prev) 22:43, 9 September 2005 Ruud Koot (talk | contribs) m (undo) * (cur) (prev) 15:18, 10 May 2005 Brazzy (talk | contribs) (O(n lg n) is optimal for a general sort algorithm (well-known proof)) (undo) * (cur) (prev) 07:36, 12 January 2005 Viriditas (talk | contribs) m (Vorlage:Compu-stub) (undo) * (cur) (prev) 07:36, 12 January 2005 Viriditas (talk | contribs) m ({Compu-stub}}) (undo) * (cur) (prev) 01:10, 3 July 2004 Decrypt3 (talk | contribs)