Buffered Resource Constraint: Algorithms and Complexity - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Conference Papers Year : 2014

Buffered Resource Constraint: Algorithms and Complexity


The notion of buffered resource is useful in many problems. A buffer contains a finite set of items required by some activities, and changing the content of the buffer is costly. For instance, in instruction scheduling, the registers are a buffered resource and any switch of registers has a significant impact on the total runtime of the compiled code. We first show that sequencing activities to minimize the number of switches in the buffer is NP-hard. We then introduce an algorithm which, given a set of already sequenced activities, computes a buffer assignment which minimizes the number of switches in linear time, i.e., $O(nd)$ where $n$ is the length of the sequence and $d$ the number of buffered items. Next, we introduce an algorithm to achieve bound consistency on the constraint \switch, that bounds the number of changes in the buffer, in $O(n^2d+n^{1.5}d^{1.5})$ time. Finally, we report the results of experimental evaluations that demonstrate the efficiency of this propagator.
Fichier principal
Vignette du fichier
paper.pdf (275.01 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01023267 , version 1 (11-07-2014)



Christian Bessiere, Emmanuel Hébrard, Marc-André Ménard, Claude-Guy Quimper, Toby Walsh. Buffered Resource Constraint: Algorithms and Complexity. CPAIOR: Integration of AI and OR Techniques in Constraint Programming, May 2014, Cork, Ireland. pp.318-333, ⟨10.1007/978-3-319-07046-9_23⟩. ⟨hal-01023267⟩
278 View
144 Download



Gmail Mastodon Facebook X LinkedIn More