Sciweavers

192 search results - page 28 / 39
» On priority queues with priority jumps
Sort
View
EUSFLAT
2009
134views Fuzzy Logic» more  EUSFLAT 2009»
14 years 7 months ago
Flow Line Systems with Possibilistic Data: a System with Waiting Time in Line Uncertain
This paper proposes to analyze two flow line systems in which we include possibilistic data -the priority-discipline is possibilistic instead of probabilistic- and measure the perf...
David de la Fuente, María José Pardo
HPCA
2012
IEEE
13 years 5 months ago
Flexible register management using reference counting
Conventional out-of-order processors that use a unified physical register file allocate and reclaim registers explicitly using a free list that operates as a circular queue. We ...
Steven Battle, Andrew D. Hilton, Mark Hempstead, A...
76
Voted
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
14 years 9 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
EOR
2010
110views more  EOR 2010»
14 years 9 months ago
Pricing surplus server capacity for mean waiting time sensitive customers
Resources including various assets of supply chains, face random demand over time and can be shared by others. We consider an operational setting where a resource is shared by two...
Sudhir K. Sinha, N. Rangaraj, N. Hemachandra
MST
2011
200views Hardware» more  MST 2011»
14 years 4 months ago
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
Antonio Fernández Anta, José Luis L&...