Enhancing adaptivity via standard dynamic scheduling middleware
نویسندگان
چکیده
منابع مشابه
Enhancing the Adaptivity of Distributed Real-time and Embedded Systems via Standard QoS-enabled Dynamic Scheduling Middleware
To support the dynamically changing QoS needs of open distributed real-time embedded (DRE) systems, it is essential to propagate QoS parameters and to enforce task QoS requirements adaptably across multiple endsystems dynamically in a way that is simultaneously efficient, flexible, and timely. This paper makes three contributions to research on QoS-enabled middleware that supports these types o...
متن کاملEnhancing Scatternets Performance via Scheduling Algorithm Parametrization
Bluetooth specification still has open issues, including the intra and interpiconet scheduling topics. This paper proposes an interpiconet scheduling algorithm, referred to as AISA (Adaptive Interpiconet Scheduling Algorithm). AISA is characterized by: its adaptability to varying network traffic conditions; and its ability to optimize specific performance metrics via parametrization. Both featu...
متن کاملPatterns in Global Dynamic Middleware Scheduling and Binding
This position paper describes patterns that we have discovered in the process of developing models and algorithms for global dynamic real-time QoS scheduling and binding in distributed object computing middleware. Some of these patterns are similar to previously defined patterns, while others are new due to the real-time nature of the applications in which they will be implemented. We first bri...
متن کاملEnhancing Data Cache Performance via Dynamic Allocation
As process technologies get smaller, the mounting problem of wire delay is becoming a pervasive challenge in the microprocessor architecture community. In order to not sacrifice the seemingly required benefits of a larger, more associative level 1 (L1) data cache, architects have opted for an L1 data cache that has a multiple cycle latency. Largely overlooked, however, is the data reference pat...
متن کاملOptimal Sensor Scheduling via Non-standard Multi-armed Bandit Formulation
This paper addresses optimal sensor scheduling for maximizing network lifetime. We formulate this problem as a nonstandard multi-armed bandit process with non-discounted reward and finite stopping time. We find that the optimal strategy should choose the sensor that has the largest Gittins’ index. Exploiting the underlying structure of sensor scheduling problem, we reduce the computational comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2004
ISSN: 0104-6500
DOI: 10.1590/s0104-65002004000200003