25,186 research outputs found
Task Scheduling on the Cloud with Hard Constraints
Scheduling Bag-of-Tasks (BoT) applications on the cloud can be more
challenging than grid and cluster environ- ments. This is because a user may
have a budgetary constraint or a deadline for executing the BoT application in
order to keep the overall execution costs low. The research in this paper is
motivated to investigate task scheduling on the cloud, given two hard
constraints based on a user-defined budget and a deadline. A heuristic
algorithm is proposed and implemented to satisfy the hard constraints for
executing the BoT application in a cost effective manner. The proposed
algorithm is evaluated using four scenarios that are based on the trade-off
between performance and the cost of using different cloud resource types. The
experimental evaluation confirms the feasibility of the algorithm in satisfying
the constraints. The key observation is that multiple resource types can be a
better alternative to using a single type of resource.Comment: Visionary Track of the IEEE 11th World Congress on Services (IEEE
SERVICES 2015
Budget Constrained Execution of Multiple Bag-of-Tasks Applications on the Cloud
Optimising the execution of Bag-of-Tasks (BoT) applications on the cloud is a
hard problem due to the trade- offs between performance and monetary cost. The
problem can be further complicated when multiple BoT applications need to be
executed. In this paper, we propose and implement a heuristic algorithm that
schedules tasks of multiple applications onto different cloud virtual machines
in order to maximise performance while satisfying a given budget constraint.
Current approaches are limited in task scheduling since they place a limit on
the number of cloud resources that can be employed by the applications.
However, in the proposed algorithm there are no such limits, and in comparison
with other approaches, the algorithm on average achieves an improved
performance of 10%. The experimental results also highlight that the algorithm
yields consistent performance even with low budget constraints which cannot be
achieved by competing approaches.Comment: 8th IEEE International Conference on Cloud Computing (CLOUD 2015
Design project planning, monitoring and re-planning through process simulation
Effective management of design schedules is a major concern in industry, since timely project delivery can have a significant influence on a company’s profitability. Based on insights gained through a case study of planning practice in aero-engine component design, this paper examines how task network simulation models can be deployed in a new way to support design process planning. Our method shows how simulation can be used to reconcile a description of design activities and information flows with project targets such as milestone delivery dates. It also shows how monitoring and re-planning can be supported using the non-ideal metrics which the case study revealed are used to monitor processes in practice. The approach is presented as a theoretical contribution which requires further work to implement and evaluate in practice
A Survey of Techniques For Improving Energy Efficiency in Embedded Computing Systems
Recent technological advances have greatly improved the performance and
features of embedded systems. With the number of just mobile devices now
reaching nearly equal to the population of earth, embedded systems have truly
become ubiquitous. These trends, however, have also made the task of managing
their power consumption extremely challenging. In recent years, several
techniques have been proposed to address this issue. In this paper, we survey
the techniques for managing power consumption of embedded systems. We discuss
the need of power management and provide a classification of the techniques on
several important parameters to highlight their similarities and differences.
This paper is intended to help the researchers and application-developers in
gaining insights into the working of power management techniques and designing
even more efficient high-performance embedded systems of tomorrow
The Project Scheduling Problem with Non-Deterministic Activities Duration: A Literature Review
Purpose: The goal of this article is to provide an extensive literature review of the models and solution procedures proposed by many researchers interested on the Project Scheduling Problem with nondeterministic activities duration. Design/methodology/approach: This paper presents an exhaustive literature review, identifying the existing models where the activities duration were taken as uncertain or random parameters. In order to get published articles since 1996, was employed the Scopus database. The articles were selected on the basis of reviews of abstracts, methodologies, and conclusions. The results were classified according to following characteristics: year of publication, mathematical representation of the activities duration, solution techniques applied, and type of problem solved. Findings: Genetic Algorithms (GA) was pointed out as the main solution technique employed by researchers, and the Resource-Constrained Project Scheduling Problem (RCPSP) as the most studied type of problem. On the other hand, the application of new solution techniques, and the possibility of incorporating traditional methods into new PSP variants was presented as research trends. Originality/value: This literature review contents not only a descriptive analysis of the published articles but also a statistical information section in order to examine the state of the research activity carried out in relation to the Project Scheduling Problem with non-deterministic activities duration.Peer Reviewe
- …