Resource-sharing systems and hypergraph colorings

Wu-Hsiung Lin () and Gerard J. Chang ()
Additional contact information
Wu-Hsiung Lin: National Taiwan University
Gerard J. Chang: National Taiwan University

Journal of Combinatorial Optimization, 2011, vol. 22, issue 4, No 2, 499-508

Abstract: Abstract A resource-sharing system is modeled by a hypergraph H in which a vertex represents a process and an edge represents a resource consisting of all vertices (processes) that have access to it. A schedule of H=(V,E) is a mapping f:ℕ→2 V , where f(i) is an independent set of H which consists of processes that operate at round i. The rate of f is defined as ${\rm rate}(f)=\limsup_{n\to\infty}\sum_{i=1}^{n}|f(i)|/(n|V|)$ , which is the average fraction of operating processes at each round. The purpose of this paper is to study optimal rates for various classes of schedules under different fairness conditions. In particular, we give relations between these optimal rates and fractional/circular chromatic numbers. For the special case of the hypergraph is a connected graph, a new derivation for the previous result by Yeh and Zhu is also given.

Keywords: Resource-sharing system; Hypergraph; Fractional chromatic number; Circular chromatic number (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-010-9295-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:22:y:2011:i:4:d:10.1007_s10878-010-9295-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-010-9295-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().