1404 search results - page 6 / 281 » Complexity of admissible rules |
INFOCOM
1997
IEEE
14 years 1 months ago
1997
IEEE
In this paper we present algorithms for flow admission control at an EDF link scheduler when the flows are characterized by peak rate, average rate and burst size. We show that th...
FMCAD
2007
Springer
14 years 4 months ago
2007
Springer
—We show how to verify the correctness of transactional memory implementations with a model checker. We show how to specify transactional memory in terms of the admissible interc...
MSWIM
2006
ACM
14 years 3 months ago
2006
ACM
Third generation wireless systems can simultaneously accommodate flow transmissions of users with widely heterogeneous applications. As resources are limited (particularly in the...
JSSPP
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. This paper describes a new and novel scheme for job admission and resource allocation employed by the SODA scheduler in System S. Capable of processing enormous quantitie...
ECRTS
2007
IEEE
14 years 4 months ago
2007
IEEE
Existing real-time research focuses on how to formulate, model and enforce timeliness guarantees for task sets whose correctness has a temporal aspect. However, the resulting syst...