Making data center computations fast, but not so furious
We propose an aggressive computational sprinting variant for data center environments. While most of previous work on computational sprinting focuses on maximizing the sprinting process while ensuring non-faulty conditions, we take advantage of the existing replication in data centers to push the sy...
Gespeichert in:
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 | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Porto, Daniel Loff, João Duarte, Rui Ceze, Luis Rodrigues, Rodrigo |
description | We propose an aggressive computational sprinting variant for data center
environments. While most of previous work on computational sprinting focuses on
maximizing the sprinting process while ensuring non-faulty conditions, we take
advantage of the existing replication in data centers to push the system beyond
its safety limits. In this paper we outline this vision, we survey existing
techniques for achieving it, and we present some design ideas for future work
in this area. |
doi_str_mv | 10.48550/arxiv.1704.05112 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1704_05112</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1704_05112</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-b24c0181685f43c15479bbf1b9532dc831c5120f6d458f257205e9c6da8296303</originalsourceid><addsrcrecordid>eNotj7tOwzAUQL10QC0fwIQ_gARf29dxxqriJRWxdI-unRhZtHFlOwj-HlGYznZ0DmM3IFptEcU95a_42UIndCsQQF4x-0ofcX7nI1XifprrlLlPp_NSqcY0Fx6o1DvulsrnVHlJPCw5pqVs2CrQsUzX_1yzw-PDYffc7N-eXnbbfUOmk42T2guwYCwGrTyg7nrnArgelRy9VeARpAhm1GiDxE4KnHpvRrKyN0qoNbv9017Sh3OOJ8rfw-_CcFlQPzehP4Y</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Making data center computations fast, but not so furious</title><source>arXiv.org</source><creator>Porto, Daniel ; Loff, João ; Duarte, Rui ; Ceze, Luis ; Rodrigues, Rodrigo</creator><creatorcontrib>Porto, Daniel ; Loff, João ; Duarte, Rui ; Ceze, Luis ; Rodrigues, Rodrigo</creatorcontrib><description>We propose an aggressive computational sprinting variant for data center
environments. While most of previous work on computational sprinting focuses on
maximizing the sprinting process while ensuring non-faulty conditions, we take
advantage of the existing replication in data centers to push the system beyond
its safety limits. In this paper we outline this vision, we survey existing
techniques for achieving it, and we present some design ideas for future work
in this area.</description><identifier>DOI: 10.48550/arxiv.1704.05112</identifier><language>eng</language><subject>Computer Science - Distributed, Parallel, and Cluster Computing</subject><creationdate>2017-04</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1704.05112$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1704.05112$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Porto, Daniel</creatorcontrib><creatorcontrib>Loff, João</creatorcontrib><creatorcontrib>Duarte, Rui</creatorcontrib><creatorcontrib>Ceze, Luis</creatorcontrib><creatorcontrib>Rodrigues, Rodrigo</creatorcontrib><title>Making data center computations fast, but not so furious</title><description>We propose an aggressive computational sprinting variant for data center
environments. While most of previous work on computational sprinting focuses on
maximizing the sprinting process while ensuring non-faulty conditions, we take
advantage of the existing replication in data centers to push the system beyond
its safety limits. In this paper we outline this vision, we survey existing
techniques for achieving it, and we present some design ideas for future work
in this area.</description><subject>Computer Science - Distributed, Parallel, and Cluster Computing</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj7tOwzAUQL10QC0fwIQ_gARf29dxxqriJRWxdI-unRhZtHFlOwj-HlGYznZ0DmM3IFptEcU95a_42UIndCsQQF4x-0ofcX7nI1XifprrlLlPp_NSqcY0Fx6o1DvulsrnVHlJPCw5pqVs2CrQsUzX_1yzw-PDYffc7N-eXnbbfUOmk42T2guwYCwGrTyg7nrnArgelRy9VeARpAhm1GiDxE4KnHpvRrKyN0qoNbv9017Sh3OOJ8rfw-_CcFlQPzehP4Y</recordid><startdate>20170417</startdate><enddate>20170417</enddate><creator>Porto, Daniel</creator><creator>Loff, João</creator><creator>Duarte, Rui</creator><creator>Ceze, Luis</creator><creator>Rodrigues, Rodrigo</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20170417</creationdate><title>Making data center computations fast, but not so furious</title><author>Porto, Daniel ; Loff, João ; Duarte, Rui ; Ceze, Luis ; Rodrigues, Rodrigo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-b24c0181685f43c15479bbf1b9532dc831c5120f6d458f257205e9c6da8296303</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer Science - Distributed, Parallel, and Cluster Computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Porto, Daniel</creatorcontrib><creatorcontrib>Loff, João</creatorcontrib><creatorcontrib>Duarte, Rui</creatorcontrib><creatorcontrib>Ceze, Luis</creatorcontrib><creatorcontrib>Rodrigues, Rodrigo</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Porto, Daniel</au><au>Loff, João</au><au>Duarte, Rui</au><au>Ceze, Luis</au><au>Rodrigues, Rodrigo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Making data center computations fast, but not so furious</atitle><date>2017-04-17</date><risdate>2017</risdate><abstract>We propose an aggressive computational sprinting variant for data center
environments. While most of previous work on computational sprinting focuses on
maximizing the sprinting process while ensuring non-faulty conditions, we take
advantage of the existing replication in data centers to push the system beyond
its safety limits. In this paper we outline this vision, we survey existing
techniques for achieving it, and we present some design ideas for future work
in this area.</abstract><doi>10.48550/arxiv.1704.05112</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.1704.05112 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_1704_05112 |
source | arXiv.org |
subjects | Computer Science - Distributed, Parallel, and Cluster Computing |
title | Making data center computations fast, but not so furious |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T04%3A54%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Making%20data%20center%20computations%20fast,%20but%20not%20so%20furious&rft.au=Porto,%20Daniel&rft.date=2017-04-17&rft_id=info:doi/10.48550/arxiv.1704.05112&rft_dat=%3Carxiv_GOX%3E1704_05112%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |