A | B | C | D | E | F | G | H | CH | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
In computing, a cache (/kæʃ/ KASH)[1] is a hardware or software component that stores data so that future requests for that data can be served faster; the data stored in a cache might be the result of an earlier computation or a copy of data stored elsewhere. A cache hit occurs when the requested data can be found in a cache, while a cache miss occurs when it cannot. Cache hits are served by reading data from the cache, which is faster than recomputing a result or reading from a slower data store; thus, the more requests that can be served from the cache, the faster the system performs.[2]
To be cost-effective, caches must be relatively small. Nevertheless, caches are effective in many areas of computing because typical computer applications access data with a high degree of locality of reference. Such access patterns exhibit temporal locality, where data is requested that has been recently requested, and spatial locality, where data is requested that is stored near data that has already been requested.
Motivation
In memory design, there is an inherent trade-off between capacity and speed because larger capacity implies larger size and thus greater physical distances for signals to travel causing propagation delays. There is also a tradeoff between high-performance technologies such as SRAM and cheaper, easily mass-produced commodities such as DRAM, flash, or hard disks.
The buffering provided by a cache benefits one or both of latency and throughput (bandwidth).
A larger resource incurs a significant latency for access – e.g. it can take hundreds of clock cycles for a modern 4 GHz processor to reach DRAM. This is mitigated by reading large chunks into the cache, in the hope that subsequent reads will be from nearby locations and can be read from the cache. Prediction or explicit prefetching can be used to guess where future reads will come from and make requests ahead of time; if done optimally, the latency is bypassed altogether.
The use of a cache also allows for higher throughput from the underlying resource, by assembling multiple fine-grain transfers into larger, more efficient requests. In the case of DRAM circuits, the additional throughput may be gained by using a wider data bus.
Operation
Hardware implements cache as a block of memory for temporary storage of data likely to be used again. Central processing units (CPUs), solid-state drives (SSDs) and hard disk drives (HDDs) frequently include hardware-based cache, while web browsers and web servers commonly rely on software caching.
A cache is made up of a pool of entries. Each entry has associated data, which is a copy of the same data in some backing store. Each entry also has a tag, which specifies the identity of the data in the backing store of which the entry is a copy.
When the cache client (a CPU, web browser, operating system) needs to access data presumed to exist in the backing store, it first checks the cache. If an entry can be found with a tag matching that of the desired data, the data in the entry is used instead. This situation is known as a cache hit. For example, a web browser program might check its local cache on disk to see if it has a local copy of the contents of a web page at a particular URL. In this example, the URL is the tag, and the content of the web page is the data. The percentage of accesses that result in cache hits is known as the hit rate or hit ratio of the cache.
The alternative situation, when the cache is checked and found not to contain any entry with the desired tag, is known as a cache miss. This requires a more expensive access of data from the backing store. Once the requested data is retrieved, it is typically copied into the cache, ready for the next access.
During a cache miss, some other previously existing cache entry is typically removed in order to make room for the newly retrieved data. The heuristic used to select the entry to replace is known as the replacement policy. One popular replacement policy, least recently used (LRU), replaces the oldest entry, the entry that was accessed less recently than any other entry. More sophisticated caching algorithms also take into account the frequency of use of entries.
Writing policies
When a system writes data to cache, it must at some point write that data to the backing store as well. The timing of this write is controlled by what is known as the write policy. There are two basic writing approaches:[3]
- Write-through: write is done synchronously both to the cache and to the backing store.
- Write-back: initially, writing is done only to the cache. The write to the backing store is postponed until the modified content is about to be replaced by another cache block.
A write-back cache is more complex to implement since it needs to track which of its locations have been written over and mark them as dirty for later writing to the backing store. The data in these locations are written back to the backing store only when they are evicted from the cache, a process referred to as a lazy write. For this reason, a read miss in a write-back cache will often require two memory backing store accesses to service: one for the write back, and one to retrieve the needed data. Other policies may also trigger data write-back. The client may make many changes to data in the cache, and then explicitly notify the cache to write back the data.
Since no data is returned to the requester on write operations, a decision needs to be made whether or not data would be loaded into the cache on write misses.
- Write allocate (also called fetch on write): data at the missed-write location is loaded to cache, followed by a write-hit operation. In this approach, write misses are similar to read misses.
- No-write allocate (also called write-no-allocate or write around): data at the missed-write location is not loaded to cache, and is written directly to the backing store. In this approach, data is loaded into the cache on read misses only.
Both write-through and write-back policies can use either of these write-miss policies, but usually they are paired.[4][5]
- A write-back cache uses write allocate, hoping for subsequent writes (or even reads) to the same location, which is now cached.
- A write-through cache uses no-write allocate. Here, subsequent writes have no advantage, since they still need to be written directly to the backing store.
Entities other than the cache may change the data in the backing store, in which case the copy in the cache may become out-of-date or stale. Alternatively, when the client updates the data in the cache, copies of those data in other caches will become stale. Communication protocols between the cache managers that keep the data consistent are associated with cache coherence.
Prefetch
On a cache read miss, caches with a demand paging policy read the minimum amount from the backing store. A typical demand-paging virtual memory implementation reads one page of virtual memory (often 4 KB) from disk into the disk cache in RAM. A typical CPU reads a single L2 cache line of 128 bytes from DRAM into the L2 cache, and a single L1 cache line of 64 bytes from the L2 cache into the L1 cache.
Caches with a prefetch input queue or more general anticipatory paging policy go further—they not only read the data requested, but guess that the next chunk or two of data will soon be required, and so prefetch that data into the cache ahead of time. Anticipatory paging is especially helpful when the backing store has a long latency to read the first chunk and much shorter times to sequentially read the next few chunks, such as disk storage and DRAM.
A few operating systems go further with a loader that always pre-loads the entire executable into RAM. A few caches go even further, not only pre-loading an entire file, but also starting to load other related files that may soon be requested, such as the page cache associated with a prefetcher or the web cache associated with link prefetching.
Examples of hardware caches
CPU cache
Small memories on or close to the CPU can operate faster than the much larger main memory.[6] Most CPUs since the 1980s have used one or more caches, sometimes in cascaded levels; modern high-end embedded, desktop and server microprocessors may have as many as six types of cache (between levels and functions).[7] Some examples of caches with a specific function are the D-cache, I-cache and the translation lookaside buffer for the memory management unit (MMU).
GPU cache
Earlier graphics processing units (GPUs) often had limited read-only texture caches, and introduced Morton order swizzled textures to improve 2D cache coherency. Cache misses would drastically affect performance, e.g. if mipmapping was not used. Caching was important to leverage 32-bit (and wider) transfers for texture data that was often as little as 4 bits per pixel, indexed in complex patterns by arbitrary UV coordinates and perspective transformations in inverse texture mapping.
As GPUs advanced (especially with General Purpose GPU compute shaders) they have developed progressively larger and increasingly general caches, including instruction caches for shaders, exhibiting increasingly common functionality with CPU caches. For example, GT200 architecture GPUs did not feature an L2 cache, while the GTX 490 GPU has 768 KB of last-level cache, the GTX TITAN GPU has 1536 KB of last-level cache, and the GTX 980 GPU has 2048 KB of last-level cache. These caches have grown to handle synchronisation primitives between threads and atomic operations, and interface with a CPU-style MMU.
DSPs
Digital signal processors have similarly generalised over the years. Earlier designs used scratchpad memory fed by direct memory access, but modern DSPs such as Qualcomm Hexagon often include a very similar set of caches to a CPU (e.g. Modified Harvard architecture with shared L2, split L1 I-cache and D-cache).[8]
Translation lookaside buffer
A memory management unit (MMU) that fetches page table entries from main memory has a specialized cache, used for recording the results of virtual address to physical address translations. This specialized cache is called a translation lookaside buffer (TLB).[9]
In-network cache
Information-centric networking
Information-centric networking (ICN) is an approach to evolve the Internet infrastructure away from a host-centric paradigm, based on perpetual connectivity and the end-to-end principle, to a network architecture in which the focal point is identified information (or content or data). Due to the inherent caching capability of the nodes in an ICN, it can be viewed as a loosely connected network of caches, which has unique requirements of caching policies. However, ubiquitous content caching introduces the challenge to content protection against unauthorized access, which requires extra care and solutions.[10]
Unlike proxy servers, in ICN the cache is a network-level solution. Therefore, it has rapidly changing cache states and higher request arrival rates; moreover, smaller cache sizes further impose a different kind of requirements on the content eviction policies. In particular, eviction policies for ICN should be fast and lightweight. Various cache replication and eviction schemes for different ICN architectures and applications have been proposed.
Policies
Time aware least recently used (TLRU)
The Time aware Least Recently Used (TLRU)[11] is a variant of LRU designed for the situation where the stored contents in cache have a valid life time. The algorithm is suitable in network cache applications, such as ICN, content delivery networks (CDNs) and distributed networks in general. TLRU introduces a new term: TTU (Time to Use). TTU is a time stamp of a content/page which stipulates the usability time for the content based on the locality of the content and the content publisher announcement. Owing to this locality based time stamp, TTU provides more control to the local administrator to regulate in network storage.
In the TLRU algorithm, when a piece of content arrives, a cache node calculates the local TTU value based on the TTU value assigned by the content publisher. The local TTU value is calculated by using a locally defined function. Once the local TTU value is calculated the replacement of content is performed on a subset of the total content stored in cache node. The TLRU ensures that less popular and small life content should be replaced with the incoming content.
Least frequent recently used (LFRU)
The Least Frequent Recently Used (LFRU)[12] cache replacement scheme combines the benefits of LFU and LRU schemes. LFRU is suitable for 'in network' cache applications, such as ICN, CDNs and distributed networks in general. In LFRU, the cache is divided into two partitions called privileged and unprivileged partitions. The privileged partition can be defined as a protected partition. If content is highly popular, it is pushed into the privileged partition. Replacement of the privileged partition is done as follows: LFRU evicts content from the unprivileged partition, pushes content from privileged partition to unprivileged partition, and finally inserts new content into the privileged partition. In the above procedure the LRU is used for the privileged partition and an approximated LFU (ALFU) scheme is used for the unprivileged partition, hence the abbreviation LFRU. The basic idea is to filter out the locally popular contents with ALFU scheme and push the popular contents to one of the privileged partition.
Weather forecast
In 2011, the use of smartphones with weather forecasting options was overly taxing AccuWeather servers; two requests within the same park would generate separate requests. An optimization by edge-servers to truncate the GPS coordinates to fewer decimal places meant that the cached results from the earlier query would be used. The number of to-the-server lookups per day dropped by half.[13]
Software caches
Disk cache
While CPU caches are generally managed entirely by hardware, a variety of software manages other caches. The page cache in main memory, which is an example of disk cache, is managed by the operating system kernel.
While the disk buffer, which is an integrated part of the hard disk drive or solid state drive, is sometimes misleadingly referred to as "disk cache", its main functions are write sequencing and read prefetching. Repeated cache hits are relatively rare, due to the small size of the buffer in comparison to the drive's capacity. However, high-end disk controllers often have their own on-board cache of the hard disk drive's data blocks.
Finally, a fast local hard disk drive can also cache information held on even slower data storage devices, such as remote servers (web cache) or local tape drives or optical jukeboxes; such a scheme is the main concept of hierarchical storage management. Also, fast flash-based solid-state drives (SSDs) can be used as caches for slower rotational-media hard disk drives, working together as hybrid drives or solid-state hybrid drives (SSHDs).
Web cache
Web browsers and web proxy servers employ web caches to store previous responses from web servers, such as web pages and images. Web caches reduce the amount of information that needs to be transmitted across the network, as information previously stored in the cache can often be re-used. This reduces bandwidth and processing requirements of the web server, and helps to improve responsiveness for users of the web.[14]
Web browsers employ a built-in web cache, but some Internet service providers (ISPs) or organizations also use a caching proxy server, which is a web cache that is shared among all users of that network.
Another form of cache is P2P caching, where the files most sought for by peer-to-peer applications are stored in an ISP cache to accelerate P2P transfers. Similarly, decentralised equivalents exist, which allow communities to perform the same task for P2P traffic, for example, Corelli.[15]
Distributed web applications should consider distributed caching.
Memoization
A cache can store data that is computed on demand rather than retrieved from a backing store. Memoization is an optimization technique that stores the results of resource-consuming function calls within a lookup table, allowing subsequent calls to reuse the stored results and avoid repeated computation. It is related to the dynamic programming algorithm design methodology, which can also be thought of as a means of caching.
Content delivery network
A content delivery network (CDN) is a network of distributed servers that deliver pages and other Web content to a user, based on the geographic locations of the user, the origin of the web page and the content delivery server.
CDNs began in the late 1990s as a way to speed up the delivery of static content, such as HTML pages, images and videos. By replicating content on multiple servers around the world and delivering it to users based on their location, CDNs can significantly improve the speed and availability of a website or application. When a user requests a piece of content, the CDN will check to see if it has a copy of the content in its cache. If it does, the CDN will deliver the content to the user from the cache.[16]
Cloud storage gateway
A cloud storage gateway, also known as an edge filer, is a hybrid cloud storage device that connects a local network to one or more cloud storage services, typically object storage services such as Amazon S3. It provides a cache for frequently accessed data, providing high speed local access to frequently accessed data in the cloud storage service. Cloud storage gateways also provide additional benefits such as accessing cloud object storage through traditional file serving protocols as well as continued access to cached data during connectivity outages.[17]
Other caches
The BIND DNS daemon caches a mapping of domain names to IP addresses, as does a resolver library.
Write-through operation is common when operating over unreliable networks (like an Ethernet LAN), because of the enormous complexity of the coherency protocol required between multiple write-back caches when communication is unreliable. For instance, web page caches and client-side network file system caches (like those in NFS or SMB) are typically read-only or write-through specifically to keep the network protocol simple and reliable.
Search engines also frequently make web pages they have indexed available from their cache. For example, Google provides a "Cached" link next to each search result. This can prove useful when web pages from a web server are temporarily or permanently inaccessible.
Database caching can substantially improve the throughput of database applications, for example in the processing of indexes, data dictionaries, and frequently used subsets of data.
A distributed cache[18] uses networked hosts to provide scalability, reliability and performance to the application.[19] The hosts can be co-located or spread over different geographical regions.
Buffer vs. cacheedit
This section needs additional citations for verification. (June 2021) |
The semantics of a "buffer" and a "cache" are not totally different; even so, there are fundamental differences in intent between the process of caching and the process of buffering.
Fundamentally, caching realizes a performance increase for transfers of data that is being repeatedly transferred. While a caching system may realize a performance increase upon the initial (typically write) transfer of a data item, this performance increase is due to buffering occurring within the caching system.
With read caches, a data item must have been fetched from its residing location at least once in order for subsequent reads of the data item to realize a performance increase by virtue of being able to be fetched from the cache's (faster) intermediate storage rather than the data's residing location. With write caches, a performance increase of writing a data item may be realized upon the first write of the data item by virtue of the data item immediately being stored in the cache's intermediate storage, deferring the transfer of the data item to its residing storage at a later stage or else occurring as a background process. Contrary to strict buffering, a caching process must adhere to a (potentially distributed) cache coherency protocol in order to maintain consistency between the cache's intermediate storage and the location where the data resides. Buffering, on the other hand,
- reduces the number of transfers for otherwise novel data amongst communicating processes, which amortizes overhead involved for several small transfers over fewer, larger transfers,
- provides an intermediary for communicating processes which are incapable of direct transfers amongst each other, or
- ensures a minimum data size or representation required by at least one of the communicating processes involved in a transfer.
With typical caching implementations, a data item that is read or written for the first time is effectively being buffered; and in the case of a write, mostly realizing a performance increase for the application from where the write originated. Additionally, the portion of a caching protocol where individual writes are deferred to a batch of writes is a form of buffering. The portion of a caching protocol where individual reads are deferred to a batch of reads is also a form of buffering, although this form may negatively impact the performance of at least the initial reads (even though it may positively impact the performance of the sum of the individual reads). In practice, caching almost always involves some form of buffering, while strict buffering does not involve caching.
A buffer is a temporary memory location that is traditionally used because CPU instructions cannot directly address data stored in peripheral devices. Thus, addressable memory is used as an intermediate stage. Additionally, such a buffer may be feasible when a large block of data is assembled or disassembled (as required by a storage device), or when data may be delivered in a different order than that in which it is produced. Also, a whole buffer of data is usually transferred sequentially (for example to hard disk), so buffering itself sometimes increases transfer performance or reduces the variation or jitter of the transfer's latency as opposed to caching where the intent is to reduce the latency. These benefits are present even if the buffered data are written to the buffer once and read from the buffer once.
A cache also increases transfer performance. A part of the increase similarly comes from the possibility that multiple small transfers will combine into one large block. But the main performance-gain occurs because there is a good chance that the same data will be read from cache multiple times, or that written data will soon be read. A cache's sole purpose is to reduce accesses to the underlying slower storage. Cache is also usually an abstraction layer that is designed to be invisible from the perspective of neighboring layers.
See alsoedit
Referencesedit
- ^ "Cache". Oxford Dictionaries. Archived from the original on 18 August 2012. Retrieved 2 August 2016.
- ^ Zhong, Liang; Zheng, Xueqian; Liu, Yong; Wang, Mengting; Cao, Yang (February 2020). "Cache hit ratio maximization in device-to-device communications overlaying cellular networks". China Communications. 17 (2): 232–238. doi:10.23919/jcc.2020.02.018. ISSN 1673-5447. S2CID 212649328.
- ^ Bottomley, James (1 January 2004). "Understanding Caching". Linux Journal. Retrieved 1 October 2019.
- ^ Hennessy, John L.; Patterson, David A. (2011). Computer Architecture: A Quantitative Approach. Elsevier. p. B–12. ISBN 978-0-12-383872-8.
- ^ Patterson, David A.; Hennessy, John L. (1990). Computer Architecture A Quantitative Approach. Morgan Kaufmann Publishers. p. 413. ISBN 1-55860-069-8.
- ^ Su, Chao; Zeng, Qingkai (10 June 2021). Nicopolitidis, Petros (ed.). "Survey of CPU Cache-Based Side-Channel Attacks: Systematic Analysis, Security Models, and Countermeasures". Security and Communication Networks. 2021: 1–15. doi:10.1155/2021/5559552. ISSN 1939-0122.
- ^ "Intel Broadwell Core i7 5775C '128MB L4 Cache' Gaming Behemoth and Skylake Core i7 6700K Flagship Processors Finally Available In Retail". 25 September 2015.Mentions L4 cache. Combined with separate I-Cache and TLB, this brings the total 'number of caches (levels+functions) to 6.
- ^ "qualcom Hexagon DSP SDK overview".
- ^ Frank Uyeda (2009). "Lecture 7: Memory Management" (PDF). CSE 120: Principles of Operating Systems. UC San Diego. Retrieved 4 December 2013.
- ^ Bilal, Muhammad; et al. (2019). "Secure Distribution of Protected Content in Information-Centric Networking". IEEE Systems Journal. 14 (2): 1–12. arXiv:1907.11717. Bibcode:2020ISysJ..14.1921B. doi:10.1109/JSYST.2019.2931813. S2CID 198967720.
- ^ Bilal, Muhammad; Kang, Shin-Gak (2014). Time Aware Least Recent Used (TLRU) cache management policy in ICN. 16th International Conference on Advanced Communication Technology. pp. 528–532. arXiv:1801.00390. Bibcode:2018arXiv180100390B. doi:10.1109/ICACT.2014.6779016. ISBN 978-89-968650-3-2. S2CID 830503.
- ^ Bilal, Muhammad; et al. (2017). "A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks". IEEE Access. 5: 1692–1701. arXiv:1702.04078. Bibcode:2017arXiv170204078B. doi:10.1109/ACCESS.2017.2669344. S2CID 14517299.
- ^ Murphy, Chris (30 May 2011). "5 Lines Of Code In The Cloud". InformationWeek. p. 28.
300 million to 500 million fewer requests a day handled by AccuWeather servers
- ^ Multiple (wiki). "Web application caching". Docforge. Archived from the original on 12 December 2019. Retrieved 24 July 2013.
- ^ Tyson, Gareth; Mauthe, Andreas; Kaune, Sebastian; Mu, Mu; Plagemann, Thomas. Corelli: A Dynamic Replication Service for Supporting Latency-Dependent Content in Community Networks (PDF). MMCN'09. Archived from the original (PDF) on 18 June 2015.
- ^ "Globally Distributed Content Delivery, by J. Dilley, B. Maggs, J. Parikh, H. Prokop, R. Sitaraman and B. Weihl, IEEE Internet Computing, Volume 6, Issue 5, November 2002" (PDF). Archived (PDF) from the original on 9 August 2017. Retrieved 25 October 2019.
- ^ "Definition: cloud storage gateway". SearchStorage. July 2014.
- ^ Paul, S.; Fei, Z. (1 February 2001). "Distributed caching with centralized control". Computer Communications. 24 (2): 256–268. CiteSeerX 10.1.1.38.1094. doi:10.1016/S0140-3664(00)00322-4.
- ^ Khan, Iqbal (July 2009). "Distributed Caching on the Path To Scalability". MSDN. 24 (7).
Further readingedit
Text je dostupný za podmienok Creative Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších podmienok. Podrobnejšie informácie nájdete na stránke Podmienky použitia.
Číňané
Časová osa ruské invaze na Ukrajinu (2022)
Černá Hora
Česká terminologická databáze knihovnictví a informační vědy
Česká verze Wikipedie
Česká Wikipedie
České vysoké učení technické v Praze
Československá armáda
Československá národní rada
Československo
Ču Jou-sung
Říše Čching
Říše Ming
Řím
Šablona:Citation
Šablona:Cite web
1. duben
1. květen
1. září
10. duben
10. prosinec
11. duben
12. duben
12. květen
13. červen
13. duben
14. duben
14. srpen
1488
15. červen
15. duben
15. květen
15. září
1523
1555
1584
1585
16. duben
16. leden
1619
1651
1652
1661
1671
1673
1674
1677
17. březen
17. duben
1706
1711
1717
1719
1729
1730
1735
1742
1752
1757
1763
1767
1774
1776
1782
1783
1784
1785
1790
1796
18. únor
18. duben
18. leden
1805
1811
1814
1816
1818
1822
1828
1829
1837
1838
1849
1852
1855
1862
1864
1868
1870
1871
1876
1878
1880
1882
1885
1886
1891
1892
1893
1895
19. duben
19. listopad
1900
1904
1906
1907
1910
1912
1913
1917
1918
1919
1920
1921
1922
1924
1926
1929
1930
1933
1935
1936
1940
1942
1945
1946
1947
1949
1950
1952
1953
1958
1960
1965
1973
1976
1977
1985
1987
1989
1990
1992
1995
2. červen
2. duben
2. květen
20. duben
2000
2001
2002
2003
2005
2008
2010
2012
2015
2017
2019
2020
2023
21. červen
21. červenec
21. březen
22. duben
23. duben
24. březen
24. duben
24. listopad
24. prosinec
25. duben
25. prosinec
26. duben
27. duben
28. duben
29. únor
29. březen
29. duben
29. srpen
3. únor
3. duben
30. duben
31. červenec
31. březen
31. prosinec
4. říjen
4. duben
4. květen
43 př. n. l.
5. říjen
5. březen
5. duben
5. květen
6. duben
7. duben
753 př. n. l.
8. duben
8. listopad
9. říjen
9. duben
9. září
Aš
ActiveX
Alžběta II.
Alžběta Vilemína Württemberská
Alexandra
Alt attribute
Amálie Vilemína Brunšvicko-Lüneburská
Andie MacDowell
Anthony Quinn
Antonín Kammel
Antonín Novák (houslista)
API
Apple
Apple II
Armáda Spojených států amerických
Article element
Autoritní kontrola
Azovstal
Bedřich Beneš Buchlovan
Benutzer:Kurt Jansson/Vortrag auf dem 19C3
Benutzer:Kurt Jansson/Vortrag auf dem 19C3
BiggestWiki
Bitva o Madagaskar
Bitva o Mariupol
Bitva u Liberce
Bitva u Mutiny
Bitva u Puebly
Blink element
Bořivoj Lůžek
Bob Hurikán
Bologna
Bracket#Angle brackets
Brasília
Brazílie
Britská armáda
Browser engine
Browser Object Model
Bzenecká lípa
Cache (computing)
CamelCase
Canvas element
Cascading Style Sheets
Character encodings in HTML
Charles-Joseph de Flahaut
Charles Darwin
Charlotte Brontëová
Chu Čeng-jen
Commons:Featured pictures/cs
Comparison of browser engines
Comparison of document markup languages
Comparison of stylesheet languages
CSS
CSS#Sources
CSS animations
CSS box model
CSS Flexible Box Layout
CSS grid layout
CSS image replacement
CSS Zen Garden
Diff
Digital container format
Div and span
Document file format
Document Object Model
Document Style Semantics and Specification Language
DokuWiki
Doněcké akademické oblastní činoherní divadlo
Druhá světová válka
Duben
Dynamic HTML
Dynastie Jižní Ming
Edita Štaubertová
Ekonomické důsledky ruské invaze na Ukrajinu (2022)
Emilia Galotti
Emmanuel Macron
Encyclopædia Britannica
Encyklopedie
Encyklopedie Navajo
Evoluce
Fantasy
Fault-tolerant system
Ferdinand Peroutka
Fieldset
File:HTML5 logo and wordmark.svg
File:Question book-new.svg
File:Wikibooks-logo.svg
Filename extension
Filmová promítačka
First-person shooter
Font family (HTML)
Formatting Output Specification Instance
Frame (World Wide Web)
François Athanase de Charette de la Contrie
Francie
Francouzská armáda
Francouzská intervence v Mexiku
Francouzská národní knihovna
František Ferdinand Šamberk
František Suchý Pražský
Fredrik Bajer
Friedrich Fröbel
Gemeinsame Normdatei
Georg Joseph Kamel
Glen Hansard
Gotthold Ephraim Lessing
Gregoriánský kalendář
Guy Lafleur
Hannibal Goodwin
Havajština
Help:HTML in wikitext
Help:Maintenance template removal
Help:Referencing for beginners
Hippolyte Taine
Hlavní strana
Hnutí Svoboda (Slovinsko)
Holy grail (web design)
Honolulu
Hospodářský růst
HTML
HTML5
HTML5 audio
HTML5 video
HTML attribute
HTML editor
HTML element
HTML element#Images and objects
HTML elements
HTM (disambiguation)
Humphry Repton
Hyperlink
Hypertext
HyperText Markup Language
Iggy Pop
Ignacio Zaragoza
Ignatius Krahl
Ingenuity
International Standard Book Number
Internetová diskuse
Internetový bot
Internet Explorer
IP adresa
Isaac Asimov
Itálie
Ivan Petrovič Kulibin
Janez Janša
Jan Štrobl
Jan Kostrhun
Jan Pavel II.
Jan van Riebeeck
Jarmila Stojčevská
Jaroslav Hýbl
Jaroslav Hutka
Jaroslav Kvapil (skladatel)
JavaScript
JavaScript Style Sheets
Jean-Baptiste Biot
Jiří Čepelák
Jiří Hrubeš
Jiřina Šedinová
Johann Christian Ferdinand Höfer
John Law
Josef I. Habsburský
Joseph Vaz
Jozef Herda
Judita Čeřovská
Kaligrafie
Kapské Město
Karel Balling (chemik)
Karel Pippich
Karlštejn
Kategorie:Čas
Kategorie:Články podle témat
Kategorie:Život
Kategorie:Dorozumívání
Kategorie:Geografie
Kategorie:Historie
Kategorie:Hlavní kategorie
Kategorie:Informace
Kategorie:Kultura
Kategorie:Lidé
Kategorie:Matematika
Kategorie:Příroda
Kategorie:Politika
Kategorie:Právo
Kategorie:Rekordy
Kategorie:Seznamy
Kategorie:Společnost
Kategorie:Sport
Kategorie:Technika
Kategorie:Umění
Kategorie:Věda
Kategorie:Vojenství
Kategorie:Vzdělávání
Kategorie:Zdravotnictví
Klaus Schulze
Kuo-c’-ťien
Květen
Ladislav Koubek
Ladislav Pavelka
Language code
Lee de Forest
Leopold Antonín Podstatský
Less (stylesheet language)
Less (style sheet language)
Library of Congress Control Number
Lidé a země
Listopad
List of style sheet languages
List of XML and HTML character entity references
Lodovico Carracci
Louis-Auguste Bisson
Lynx (browser)
Madagaskar
Maia Sanduová
Manuel Estiarte
Marcus Antonius
Maria Anna Sala
Mariupol
Markup (computer programming)
Markup language
Marquee element
Meda Mládková
MediaWiki
Media type
Metapedie
Meta element
Mezinárodní měnový fond
Michel Rolle
Miloš Zeman
Mittelbau-Dora
Moldavsko
Mozilla Firefox
Mwai Kibaki
Nápověda:Úvod
Nápověda:Úvod pro nováčky
Národní knihovna České republiky
Národní knihovna Izraele
Návrhový vzor
Nadace Wikimedia
Nanking
Necyklopedie
Nikola Buranská
Norbert Frýd
Nosticovo divadlo
Nupedia
Odbory
Olbram Zoubek
Open file format
Opera (web browser)
Osecký klášter
Otevřený software
Oxford English Dictionary
Pandemie covidu-19
Pandemie covidu-19 v Česku
Partyzán
Paul Karrer
Pavel Zářecký
Pavol Mešťan
Pečeť
Perseverance
Petr Nečas
Petr Pokorný (teolog)
Petr Rak
Plnotext
Plugin
Podněstří
Polsko
Portál:Aktuality
Portál:Doprava
Portál:Geografie
Portál:Historie
Portál:Kultura
Portál:Lidé
Portál:Náboženství
Portál:Obsah
Portál:Příroda
Portál:Sport
PostCSS
Praha
Pravda (noviny)
Prezident
Programovací jazyk
Q171#identifiers
Q171#identifiers|Editovat na Wikidatech
Qt (software)
Quirks mode
Radim Uzel
Refreshable Braille display
Responsive web design
Rio de Janeiro
Robert Fico
Robert Golob
Robert Kaliňák
Robert Saudek
Robert Smith (hudebník)
Ruská invaze na Ukrajinu (2022)
Rusko
Sýrie
Safari (web browser)
Sass (stylesheet language)
Sass (style sheet language)
Scripting language
Sedmiletá válka
Semantics
Semantic Web
Separation of concerns
Separation of content and presentation
Seznam českých wiki encyklopedií
Slávka Budínová
Slovenska demokratska stranka
Slovensko
Slovinsko
SMIL Timesheets
Sociální software
Software
Software release life cycle
Soubor:Andie MacDowell Cannes.jpg
Soubor:Anthony Quinn signed.JPG
Soubor:Apple-II.jpg
Soubor:Flag of Mars.svg
Soubor:GlenHansard.jpg
Soubor:HNL Wiki Wiki Bus.jpg
Soubor:Hutka.simecek.jpg
Soubor:IggyChesterRocks.jpg
Soubor:Manel Estiarte (Diada de Sant Jordi 2009).jpg
Soubor:Olbram-Zoubek.jpg
Soubor:Paul Karrer.jpg
Soubor:Persimmon and Three Yellow Tangerines.jpg
Soubor:Queen Elizabeth II March 2015.jpg
Soubor:Robert Smith of The Cure live in Singapore 1 August 2007.jpg
Speciální:Kategorie
Speciální:Nové stránky
Speciální:Statistika
Speciální:Zdroje knih/0-201-71499-X
Speciální:Zdroje knih/2-9520514-4-5
Speciální:Zdroje knih/9781448855575
Spojené státy americké
Standard Generalized Markup Language
Strojový překlad
Structured document
Stuttgart
Style sheet (desktop publishing)
Style sheet (web development)
Style sheet language
Stylish
Stylus (browser extension)
Stylus (stylesheet language)
Stylus (style sheet language)
Světová ekonomika
Třída T 47
Tableless web design
Template:CSS
Template:HTML
Template:Stylesheet languages
Template talk:CSS
Template talk:HTML
Template talk:Stylesheet languages
Teroristické útoky na Srí Lance 21. dubna 2019
Theodor Kašpárek
Tiskař
Turecko
TWiki
Type code
Ukrajina
Ulrich von Hutten
Unicode and HTML
Uniform Type Identifier
UseModWiki
User agent
User interface style sheet language
Václav Cigler
Vídeň
Věra Nerušilová
V-2
Vannevar Bush
Vichistická Francie
Viktor Janiš
Viktor Zvjahincev
Vláda Černé Hory
Vladimír Hulpach
Vlasta Prachatická
Vojtěch Říhovský
Volby prezidenta Francie 2022
Vzdušný prostor
W3C Markup Validation Service
Ward Cunningham
Web3D
WebCL
WebGL
WebGPU
Webový prohlížeč
Webpage
WebXR
Web browser
Web colors
Web content
Web design
Web page
Web server
Web storage
WHATWG
Wiki
Wikicitáty:Hlavní strana
Wikidata:Hlavní strana
Wikiknihy:Hlavní strana
Wikimedia Česká republika
Wikimedia Commons
Wikipedia:Verifiability
Wikipedie
Wikipedie:Údržba
Wikipedie:Časté chyby
Wikipedie:Často kladené otázky
Wikipedie:Článek týdne
Wikipedie:Článek týdne/2022
Wikipedie:Citování Wikipedie
Wikipedie:Dobré články
Wikipedie:Dobré články#Portály
Wikipedie:Kontakt
Wikipedie:Nejlepší články
Wikipedie:Obrázek týdne
Wikipedie:Obrázek týdne/2022
Wikipedie:Požadované články
Wikipedie:Pod lípou
Wikipedie:Portál Wikipedie
Wikipedie:Potřebuji pomoc
Wikipedie:Průvodce
Wikipedie:Seznam jazyků Wikipedie
Wikipedie:Velvyslanectví
Wikipedie:Vybraná výročí dne/květen
Wikipedie:WikiProjekt Kvalita/Články k rozšíření
Wikipedie:Zajímavosti
Wikipedie:Zajímavosti/2022
Wikipedie:Zdroje informací
WikiSkripta
Wikislovník:Hlavní strana
Wikiverzita:Hlavní strana
Wikizdroje:Hlavní strana
Wikizprávy:Hlavní strana
Wiki (rozcestník)
Wiki Wiki Shuttle
Wolfenstein 3D
World Wide Web
World Wide Web Consortium
WYSIWYG
XHTML
XHTML Basic
XHTML Mobile Profile
XSL
XSLT
Zdeněk Fiala
Značkovací jazyk
Zvukový film
Text je dostupný za podmienok Creative
Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších
podmienok.
Podrobnejšie informácie nájdete na stránke Podmienky
použitia.
www.astronomia.sk | www.biologia.sk | www.botanika.sk | www.dejiny.sk | www.economy.sk | www.elektrotechnika.sk | www.estetika.sk | www.farmakologia.sk | www.filozofia.sk | Fyzika | www.futurologia.sk | www.genetika.sk | www.chemia.sk | www.lingvistika.sk | www.politologia.sk | www.psychologia.sk | www.sexuologia.sk | www.sociologia.sk | www.veda.sk I www.zoologia.sk