Web search for a planet: The Google cluster architecture
Amenable to extensive parallelization, Google's web search application lets different queries run on different processors and, by partitioning the overall index, also lets a single query use multiple processors. to handle this workload, Googless architecture features clusters of more than 15,00...
Gespeichert in:
| Veröffentlicht in: | IEEE MICRO 2003-03, Vol.23 (2), p.22-28 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 28 |
|---|---|
| container_issue | 2 |
| container_start_page | 22 |
| container_title | IEEE MICRO |
| container_volume | 23 |
| creator | Barroso, L.A. Dean, J. Holzle, U. |
| description | Amenable to extensive parallelization, Google's web search application lets different queries run on different processors and, by partitioning the overall index, also lets a single query use multiple processors. to handle this workload, Googless architecture features clusters of more than 15,000 commodity-class PCs with fault tolerant software. This architecture achieves superior performance at a fraction of the cost of a system built from fewer, but more expensive, high-end servers. |
| doi_str_mv | 10.1109/MM.2003.1196112 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_MM_2003_1196112</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1196112</ieee_id><sourcerecordid>337157081</sourcerecordid><originalsourceid>FETCH-LOGICAL-c415t-ac2658757c99918a62c4f25e5087fc71f3fbe715d4665dae08fab0ca4cd09e653</originalsourceid><addsrcrecordid>eNp9kD1PwzAQhi0EEqUwM7BEDDClPTvxFxuqoCA1YilitFz3TFOlTbGTgX-Pq1ZCYmA6ne55T3cPIdcURpSCHlfViAEUqdGCUnZCBlQXMi9pWZySATDJcioLdk4uYlwDAGegBkR94CKLaINbZb4Nmc12jd1i95DNV5hN2_azwcw1fewwDRNVd-i6PuAlOfO2iXh1rEPy_vw0n7zks7fp6-RxlruS8i63jgmuJJdOa02VFcyVnnHkoKR3kvrCL1BSviyF4EuLoLxdgLOlW4JGwYshuT_s3YX2q8fYmU0dHTb7K9s-Gg1USA1CJfLuX5IpJZRWOoG3f8B124dt-sIkd4UsmYQEjQ-QC22MAb3ZhXpjw7ehYPbCTVWZvXBzFJ4SN4dEjYi_9HH6A1_peZo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>196374270</pqid></control><display><type>article</type><title>Web search for a planet: The Google cluster architecture</title><source>IEEE Electronic Library (IEL)</source><creator>Barroso, L.A. ; Dean, J. ; Holzle, U.</creator><creatorcontrib>Barroso, L.A. ; Dean, J. ; Holzle, U.</creatorcontrib><description>Amenable to extensive parallelization, Google's web search application lets different queries run on different processors and, by partitioning the overall index, also lets a single query use multiple processors. to handle this workload, Googless architecture features clusters of more than 15,000 commodity-class PCs with fault tolerant software. This architecture achieves superior performance at a fraction of the cost of a system built from fewer, but more expensive, high-end servers.</description><identifier>ISSN: 0272-1732</identifier><identifier>EISSN: 1937-4143</identifier><identifier>DOI: 10.1109/MM.2003.1196112</identifier><identifier>CODEN: IEMIDZ</identifier><language>eng</language><publisher>Los Alamitos: IEEE</publisher><subject>Application software ; Architecture ; Clusters ; Computer architecture ; Delay ; Energy efficiency ; Fault tolerance ; Personal communication networks ; Planets ; Processors ; Queries ; Search engines ; Searching ; Service oriented architecture ; System built ; Web search ; Web services ; Workload</subject><ispartof>IEEE MICRO, 2003-03, Vol.23 (2), p.22-28</ispartof><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar/Apr 2003</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c415t-ac2658757c99918a62c4f25e5087fc71f3fbe715d4665dae08fab0ca4cd09e653</citedby><cites>FETCH-LOGICAL-c415t-ac2658757c99918a62c4f25e5087fc71f3fbe715d4665dae08fab0ca4cd09e653</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1196112$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1196112$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Barroso, L.A.</creatorcontrib><creatorcontrib>Dean, J.</creatorcontrib><creatorcontrib>Holzle, U.</creatorcontrib><title>Web search for a planet: The Google cluster architecture</title><title>IEEE MICRO</title><addtitle>MM</addtitle><description>Amenable to extensive parallelization, Google's web search application lets different queries run on different processors and, by partitioning the overall index, also lets a single query use multiple processors. to handle this workload, Googless architecture features clusters of more than 15,000 commodity-class PCs with fault tolerant software. This architecture achieves superior performance at a fraction of the cost of a system built from fewer, but more expensive, high-end servers.</description><subject>Application software</subject><subject>Architecture</subject><subject>Clusters</subject><subject>Computer architecture</subject><subject>Delay</subject><subject>Energy efficiency</subject><subject>Fault tolerance</subject><subject>Personal communication networks</subject><subject>Planets</subject><subject>Processors</subject><subject>Queries</subject><subject>Search engines</subject><subject>Searching</subject><subject>Service oriented architecture</subject><subject>System built</subject><subject>Web search</subject><subject>Web services</subject><subject>Workload</subject><issn>0272-1732</issn><issn>1937-4143</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kD1PwzAQhi0EEqUwM7BEDDClPTvxFxuqoCA1YilitFz3TFOlTbGTgX-Pq1ZCYmA6ne55T3cPIdcURpSCHlfViAEUqdGCUnZCBlQXMi9pWZySATDJcioLdk4uYlwDAGegBkR94CKLaINbZb4Nmc12jd1i95DNV5hN2_azwcw1fewwDRNVd-i6PuAlOfO2iXh1rEPy_vw0n7zks7fp6-RxlruS8i63jgmuJJdOa02VFcyVnnHkoKR3kvrCL1BSviyF4EuLoLxdgLOlW4JGwYshuT_s3YX2q8fYmU0dHTb7K9s-Gg1USA1CJfLuX5IpJZRWOoG3f8B124dt-sIkd4UsmYQEjQ-QC22MAb3ZhXpjw7ehYPbCTVWZvXBzFJ4SN4dEjYi_9HH6A1_peZo</recordid><startdate>20030301</startdate><enddate>20030301</enddate><creator>Barroso, L.A.</creator><creator>Dean, J.</creator><creator>Holzle, U.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20030301</creationdate><title>Web search for a planet: The Google cluster architecture</title><author>Barroso, L.A. ; Dean, J. ; Holzle, U.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c415t-ac2658757c99918a62c4f25e5087fc71f3fbe715d4665dae08fab0ca4cd09e653</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Application software</topic><topic>Architecture</topic><topic>Clusters</topic><topic>Computer architecture</topic><topic>Delay</topic><topic>Energy efficiency</topic><topic>Fault tolerance</topic><topic>Personal communication networks</topic><topic>Planets</topic><topic>Processors</topic><topic>Queries</topic><topic>Search engines</topic><topic>Searching</topic><topic>Service oriented architecture</topic><topic>System built</topic><topic>Web search</topic><topic>Web services</topic><topic>Workload</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Barroso, L.A.</creatorcontrib><creatorcontrib>Dean, J.</creatorcontrib><creatorcontrib>Holzle, U.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE MICRO</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Barroso, L.A.</au><au>Dean, J.</au><au>Holzle, U.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Web search for a planet: The Google cluster architecture</atitle><jtitle>IEEE MICRO</jtitle><stitle>MM</stitle><date>2003-03-01</date><risdate>2003</risdate><volume>23</volume><issue>2</issue><spage>22</spage><epage>28</epage><pages>22-28</pages><issn>0272-1732</issn><eissn>1937-4143</eissn><coden>IEMIDZ</coden><abstract>Amenable to extensive parallelization, Google's web search application lets different queries run on different processors and, by partitioning the overall index, also lets a single query use multiple processors. to handle this workload, Googless architecture features clusters of more than 15,000 commodity-class PCs with fault tolerant software. This architecture achieves superior performance at a fraction of the cost of a system built from fewer, but more expensive, high-end servers.</abstract><cop>Los Alamitos</cop><pub>IEEE</pub><doi>10.1109/MM.2003.1196112</doi><tpages>7</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0272-1732 |
| ispartof | IEEE MICRO, 2003-03, Vol.23 (2), p.22-28 |
| issn | 0272-1732 1937-4143 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_MM_2003_1196112 |
| source | IEEE Electronic Library (IEL) |
| subjects | Application software Architecture Clusters Computer architecture Delay Energy efficiency Fault tolerance Personal communication networks Planets Processors Queries Search engines Searching Service oriented architecture System built Web search Web services Workload |
| title | Web search for a planet: The Google cluster architecture |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T16%3A42%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Web%20search%20for%20a%20planet:%20The%20Google%20cluster%20architecture&rft.jtitle=IEEE%20MICRO&rft.au=Barroso,%20L.A.&rft.date=2003-03-01&rft.volume=23&rft.issue=2&rft.spage=22&rft.epage=28&rft.pages=22-28&rft.issn=0272-1732&rft.eissn=1937-4143&rft.coden=IEMIDZ&rft_id=info:doi/10.1109/MM.2003.1196112&rft_dat=%3Cproquest_RIE%3E337157081%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=196374270&rft_id=info:pmid/&rft_ieee_id=1196112&rfr_iscdi=true |