Filters








315 Hits in 6.4 sec

Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling

Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson
<span title="2016-07-18">2016</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ky52f5ttt5helfz75hzbyylxzq" style="color: black;">ACM Transactions on Parallel Computing</a> </i> &nbsp;
This paper introduces PRISM, a chromatic-scheduling algorithm for executing dynamic data-graph computations.  ...  This paper also presents PRISM-R, a variation of PRISM that executes dynamic data-graph computations deterministically even when updates modify global variables with associative operations.  ...  Thanks to Aydın Buluç of Lawrence Berkeley Laboratory for helping us in our search for collections of large sparse graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2896850">doi:10.1145/2896850</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/62v4zz3plvfwve54umhkro2vbu">fatcat:62v4zz3plvfwve54umhkro2vbu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719094422/http://dspace.mit.edu/bitstream/handle/1721.1/115393/chromatictopc.pdf;jsessionid=E2C1B65D75109E08695B93B955127D1A?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/56/57/56571d4c40c60c5571cb36b194496d8e22abd3de.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2896850"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Executing dynamic data-graph computations deterministically using chromatic scheduling

Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tewj77cuufbzbgbk265bb462ga" style="color: black;">Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures - SPAA &#39;14</a> </i> &nbsp;
This paper introduces PRISM, a chromatic-scheduling algorithm for executing dynamic data-graph computations.  ...  This paper also presents PRISM-R, a variation of PRISM that executes dynamic data-graph computations deterministically even when updates modify global variables with associative operations.  ...  Thanks to Aydın Buluç of Lawrence Berkeley Laboratory for helping us in our search for collections of large sparse graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2612669.2612673">doi:10.1145/2612669.2612673</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/spaa/KalerHSL14.html">dblp:conf/spaa/KalerHSL14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uf75x4odrnbghm2xjy6ue63zl4">fatcat:uf75x4odrnbghm2xjy6ue63zl4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719094422/http://dspace.mit.edu/bitstream/handle/1721.1/115393/chromatictopc.pdf;jsessionid=E2C1B65D75109E08695B93B955127D1A?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/56/57/56571d4c40c60c5571cb36b194496d8e22abd3de.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2612669.2612673"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Ordering heuristics for parallel graph coloring

William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tewj77cuufbzbgbk265bb462ga" style="color: black;">Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures - SPAA &#39;14</a> </i> &nbsp;
This paper introduces PRISM, a chromatic-scheduling algorithm for executing dynamic data-graph computations.  ...  This paper also presents PRISM-R, a variation of PRISM that executes dynamic data-graph computations deterministically even when updates modify global variables with associative operations.  ...  Let us now see how PRISM uses chromatic scheduling to execute a dynamic data-graph computation G, f , Q 0 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2612669.2612697">doi:10.1145/2612669.2612697</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/spaa/HasenplaughKSL14.html">dblp:conf/spaa/HasenplaughKSL14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bwui6b4ngjaqbn3whk6z2tulsm">fatcat:bwui6b4ngjaqbn3whk6z2tulsm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170923012345/http://dspace.mit.edu/bitstream/handle/1721.1/100928/Leiserson_Executing%20dynamic.pdf?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/97/82/9782d3fc7eaa65f165d171d0e2f0ab3ea121b221.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2612669.2612697"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Page 1421 of Mathematical Reviews Vol. , Issue 2000b [page]

<span title="">2000</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Summary: “We show that there is a good algorithm for scheduling the average completion time of a set of unknown DAGs (i.e., data dependency relation graphs of programs) on a multiprocessor in the PRAM  ...  We analyze the average-case performance of the dynamic and randomized tree node distribution algorithm using recurrence relations that characterize expected loads on proces- sors.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2000-02_2000b/page/1421" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2000-02_2000b/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Distributed Transactional Contention Management as the Traveling Salesman Problem [chapter]

Bo Zhang, Binoy Ravindran, Roberto Palmieri
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We first construct a dynamic ordering conflict graph G * c (φ(κ)) for an offline algorithm (κ, φκ).  ...  We further illustrate that when the set of transactions are dynamically generated, processing transactions according to a χ(Gc)-coloring of Gc does not lead to an optimal schedule, where χ(Gc) is the chromatic  ...  To find an optimal scheduling algorithm, we construct a dynamic ordering conflict graph G * c (φ(κ)) for an offline algorithm (κ, φ κ ), which computes a k-coloring instance κ of the dynamic conflict graph  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-09620-9_6">doi:10.1007/978-3-319-09620-9_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nwkqvbx6qnbgzf3iijiu4t2rbu">fatcat:nwkqvbx6qnbgzf3iijiu4t2rbu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170611094619/http://www.ssrg.ece.vt.edu:80/papers/sirocco14.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c0/61/c061493ba69140417979ef1cd0da4f74a1c255db.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-09620-9_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

GraphLab: A Distributed Framework for Machine Learning in the Cloud [article]

Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin
<span title="2011-07-05">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We conduct a comprehensive evaluation of GraphLab on three state-of-the-art ML algorithms using real large-scale data and a 64 node EC2 cluster of 512 processors.  ...  To enable ML researchers to easily and efficiently use parallel systems, we introduced the GraphLab abstraction which is designed to represent the computational patterns in ML algorithms while permitting  ...  Once again, the bipartite graph is naturally two colored, allowing us to use the chromatic scheduler. Due to the density of the graph, a random partitioning was used.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1107.0922v1">arXiv:1107.0922v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7rqfuyt4yrbopcpa75ofn7cw4i">fatcat:7rqfuyt4yrbopcpa75ofn7cw4i</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1107.0922/1107.0922.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/12/64/1264fabe2f436f6ca43cbcc9fa2c5cb8916b8c39.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1107.0922v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs [chapter]

Stephen Fitzpatrick, Lambert Meertens
<span title="">2001</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
This paper reports on a simple, decentralized, anytime, stochastic, soft graph-colouring algorithm.  ...  The algorithm is designed to quickly reduce the number of colour conflicts in large, sparse graphs in a scalable, robust, low-cost manner.  ...  analysis of the experimental data).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45322-9_3">doi:10.1007/3-540-45322-9_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7lg5somafnbe5ngces2ndnwmja">fatcat:7lg5somafnbe5ngces2ndnwmja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060307162336/http://www.kestrel.edu:80/home/people/fitzpatrick/pub/SAGA01.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ec/b7/ecb7c9253642b2b8d4d4e8040f8fab1a6e7e92b0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45322-9_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Improved Distributed Fractional Coloring Algorithms [article]

Alkida Balliu, Fabian Kuhn, Dennis Olivetti
<span title="2021-12-09">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The minimum c for which a fractional c-coloring of a graph G exists is called the fractional chromatic number χ_f(G) of G.  ...  We further show that in O(log n/ϵ) rounds, it is possible to compute a fractional (1+ϵ)χ_f(G)-coloring, even if the fractional chromatic number χ_f(G) is not known.  ...  In Section 6 we show randomized and deterministic algorithms for computing arbitrarily good approximations of the chromatic number of a graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2112.04405v2">arXiv:2112.04405v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/szjicm6cnng6rhahcedqli6iya">fatcat:szjicm6cnng6rhahcedqli6iya</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211211035708/https://arxiv.org/pdf/2112.04405v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/63/53/6353fd94b44ef5ff662967efb7b2d38b507afae7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2112.04405v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Graph Analytics Through Fine-Grained Parallelism

Zechao Shang, Feifei Li, Jeffrey Xu Yu, Zhiwei Zhang, Hong Cheng
<span title="">2016</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vxrc3vebzzachiwy3nopwi3h5u" style="color: black;">Proceedings of the 2016 International Conference on Management of Data - SIGMOD &#39;16</a> </i> &nbsp;
Our results show that the proposed hybrid synchronous scheduler has significantly outperformed other synchronous schedulers in existing graph analytical engines, as well as BSP and asynchronous schedulers  ...  Large graphs are getting increasingly popular and even indispensable in many applications, for example, in social media data, large networks, and knowledge bases.  ...  Chromatic scheduler. First proposed in [33] , chromatic scheduler ensures data consistency in graph analytics by assigning colors to vertices.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2882903.2915238">doi:10.1145/2882903.2915238</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigmod/ShangLYZC16.html">dblp:conf/sigmod/ShangLYZC16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ru3d5ebn75b3pihqyqieqsbcje">fatcat:ru3d5ebn75b3pihqyqieqsbcje</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161110111020/http://www.cs.utah.edu/~lifeifei/papers/parallelgraph.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/95/fb/95fb903ad36d11486efc059f7cbb6c8108f6700e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2882903.2915238"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Bounds on Contention Management Algorithms [chapter]

Johannes Schneider, Roger Wattenhofer
<span title="">2009</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Our algorithms are local because they do not use global synchronization data structures (e.g., a shared counter), hence they do not introduce additional resource conflicts which eventually might limit  ...  We present two new algorithms for contention management in transactional memory, the deterministic algorithm CommitRounds and the randomized algorithm RandomizedRounds.  ...  Related work In [7] Dynamic STM (DSTM) targeted towards dynamic data structures was described, which suggests the use of a contention manager as an independent module.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-10631-6_46">doi:10.1007/978-3-642-10631-6_46</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/drnvxb75arbbhdjgrdcm5sh6cu">fatcat:drnvxb75arbbhdjgrdcm5sh6cu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171003212733/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/d30/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUxMDAwNTcyNA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2b/78/2b78897e48c4e5647fb1ab7c182c73dbab9ddcd1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-10631-6_46"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Bounds on contention management algorithms

Johannes Schneider, Roger Wattenhofer
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Our algorithms are local because they do not use global synchronization data structures (e.g., a shared counter), hence they do not introduce additional resource conflicts which eventually might limit  ...  We present two new algorithms for contention management in transactional memory, the deterministic algorithm CommitRounds and the randomized algorithm RandomizedRounds.  ...  Related work In [7] Dynamic STM (DSTM) targeted towards dynamic data structures was described, which suggests the use of a contention manager as an independent module.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2010.10.010">doi:10.1016/j.tcs.2010.10.010</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3s4v3nr5brd6jk65ota4lbigmq">fatcat:3s4v3nr5brd6jk65ota4lbigmq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171003212733/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/d30/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUxMDAwNTcyNA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2b/78/2b78897e48c4e5647fb1ab7c182c73dbab9ddcd1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2010.10.010"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Shared buffer implementations of signal processing systems using lifetime analysis techniques

P.K. Murthy, S.S. Bhattacharyya
<span title="">2001</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rl7xk4fwazdrred2difr6v3lii" style="color: black;">IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</a> </i> &nbsp;
The method we use is that of lifetime analysis; we develop a model for buffer lifetimes in SDF graphs and develop scheduling algorithms that attempt to generate schedules that minimize the maximum number  ...  This results in schedules whose data memory usage is drastically lower than methods in the past have achieved.  ...  Goddard and Jeffay use a dynamic scheduling strategy for reducing memory requirements of SDF graphs and develop an earliest-deadline-first (EDF) type of dynamic scheduler [10] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/43.908427">doi:10.1109/43.908427</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mxr3qdgrtbadtccfs3rdeb3isu">fatcat:mxr3qdgrtbadtccfs3rdeb3isu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813151951/http://www.ece.umd.edu/DSPCAD/papers/murt2001x1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0c/c4/0cc441a2609ad4abdbeea77f850866bfd9beaa24.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/43.908427"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Improved Dynamic Graph Coloring

Shay Solomon, Nicole Wein, Michael Wagner
<span title="2018-08-08">2018</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uot5qmdbz5g6rasdd5kuoonkzu" style="color: black;">European Symposium on Algorithms</a> </i> &nbsp;
general graphs in the dynamic setting.  ...  This paper studies the fundamental problem of graph coloring in fully dynamic graphs.  ...  Introduction Background Graph coloring is one of the most fundamental and well studied problems in computer science, having found countless applications over the years, ranging from scheduling and computational  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.esa.2018.72">doi:10.4230/lipics.esa.2018.72</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/esa/SolomonW18.html">dblp:conf/esa/SolomonW18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hfux43zt45gojltar2lhct6dqu">fatcat:hfux43zt45gojltar2lhct6dqu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220121124342/https://drops.dagstuhl.de/opus/volltexte/2018/9535/pdf/LIPIcs-ESA-2018-72.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/97/fa/97fa2b38db6bb28eeb8f3e6a7734bbb741d165a1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.esa.2018.72"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Allocation and scheduling of Conditional Task Graphs

Michele Lombardi, Michela Milano
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/weoplee4x5anpi62cco5v4higa" style="color: black;">Artificial Intelligence</a> </i> &nbsp;
We propose an original, complete and efficient approach to the allocation and scheduling of Conditional Task Graphs (CTGs).  ...  For this problem we need to extend traditional constraint-based scheduling techniques in two directions: (i) compute the probability of sets of scenarios in polynomial time, in order to get the expected  ...  We propose to use a data structure, called Branch/Fork Graph, enabling efficient probabilistic reasoning.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.artint.2010.02.004">doi:10.1016/j.artint.2010.02.004</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/w5jlinxgyjewpgimz5cyqymz5u">fatcat:w5jlinxgyjewpgimz5cyqymz5u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171004170659/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/e37/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAwNDM3MDIxMDAwMDI2Mw%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/45/a5/45a50731877c565f93875aee81e98763b82389fc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.artint.2010.02.004"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

An Investigation on the Nature of Wireless Scheduling

Cem Boyaci, Bo Li, Ye Xia
<span title="">2010</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2n2fyi4qgfa53mwrtarkk6ysnm" style="color: black;">2010 Proceedings IEEE INFOCOM</a> </i> &nbsp;
Then, the scheduling-for-stability problem under deterministic arrivals is studied in light of this relationship.  ...  We emphasize the requirement that the scheduling algorithm uses a tractable amount of processing and storage resources.  ...  The weighted fractional chromatic number of a given interference graph in the wireless scheduling context can be interpreted as the fastest way of serving queued data (without additional arrivals) in the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infcom.2010.5462087">doi:10.1109/infcom.2010.5462087</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/infocom/BoyaciLX10.html">dblp:conf/infocom/BoyaciLX10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j6kteaxbm5dk7duq67mpkxnoim">fatcat:j6kteaxbm5dk7duq67mpkxnoim</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809003744/https://www.cise.ufl.edu/~yx1/publications/Cem_Infocom10.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f7/6e/f76e300ef1f91cd00b808d4c96b185ed420b5a9c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infcom.2010.5462087"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 315 results