The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Nowadays cloud service providers usually offer users virtual machines with various combinations of configurations and prices. As this new service scheme emerges, the problem of choosing the cost-minimized combination under a deadline constraint is becoming more complex for users. The complexity of determining the cost-minimized combination may be resulted from different causes: the characteristics...
Recent advances in vehicular networks, GPS and smartphone technologies have changed the paradigm of intelligent taxicab systems. Indeed, taxicab trajectories and online calling information have enabled us to provide more efficient and personalized services. However, existing approaches are not sufficient in exploiting cooperative scheduling techniques and utilizing real time calling information. To...
Among many DAG scheduling algorithms targeting at maximizing DAG ready tasks to cope with temporal uncertainties that occurs during task execution, the PB heuristic seems promising. This paper presents the work of adapting PB to a real distributed multi-core computing system with the PaRSEC scheduling runtime. The application performance results before and after adapting the PB heuristic to PaRSEC...
As distributed systems get increasingly popular in the use for large-scale computational/storage requirements, more attention has been put on the benefit of the system resource providers. This paper focuses on the online scheduling problem of how to schedule a set of sequentially submitted workflows with deadline constraints to maximize the resource utilization as well as the success rate of meeting...
In practical Cloud/Grid computing systems, DAG scheduling may be faced with challenges arising from severe uncertainty about the underlying platform. For instance, it could be hard to have explicit information about task execution time and/or the availability of resources, both may change dynamically, in difficult to predict ways. In such a setting, the development of various kinds of just-in-time...
There is an increasing interest for cloud services to be provided in a more energy efficient way. The growing deployment of large-scale, complex workflow applications onto cloud computing hosts is being faced with crucial challenges in reducing the power consumption without violating the service level agreement (SLA). In this paper, we consider cloud hosts which can operate in different power states...
In the context of scheduling for multiprocessor computing systems, there have been increasing research interests on algorithms using the Dynamic Voltage Scaling (DVS) technique, which allows processors to operate at lower voltage supply levels at the expense of sacrificing processing speed, to acquire a satisfactory trade-off between quality of schedule and energy consumption. The problem considered...
In most heterogeneous computing systems, there is a need for solutions that can cope with the unavoidable uncertainty in individual task execution times, when scheduling DAGs. When such uncertainties occur, static DAG scheduling approaches may suffer, and some rescheduling may be necessary. Assuming that the uncertainty in task execution times is modelled in a stochastic manner, then we may be able...
We present and evaluate a low-overhead approach for achieving high-availability in distributed event-processing middleware systems consisting of networks of stateful software components that communicate by either one-way (send) or two-way (call) messages. The approach is based on transparently augmenting each component to produce a deterministic component whose state can be recovered by checkpoint...
The focus of this paper is dynamic link allocation algorithms for sharing the limited link resources of the tracking and data relay satellites (TDRS) system among many burst users with varying quality of service (QoS) requirements. The task of scheduling communications between TDRS link and spacecraft is getting more and more critical since an increasing number of spacecraft must communicate with...
The complexity and physical distribution of modern active safety, chassis and powertrain automotive applications requires the use of distributed architectures. Complex functions designed as networks of function blocks exchanging signal information are deployed onto the physical HW and implemented in a SW architecture consisting of a set of tasks and messages. The typical configuration features priority-based...
Schedulability theory provides support for the analysis of the worst case latencies in distributed computations when the architecture of the system is known and the communication and synchronization mechanisms have been defined. In the design of complex automotive systems, however, a great benefit of schedulability analysis may come from its use as an aid in the exploration of the software architecture...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.