Current processor allocation techniques for highly parallel systems are based on centralized front-end based algorithms. As a result, the applied strategies are restricted to static allocation, low parallelism and weak fault tolerance. To... more
Current processor allocation techniques for highly parallel systems are based on centralized front-end based algorithms. As a result, the applied strategies are restricted to static allocation, low parallelism and weak fault tolerance. To lift these restrictions we are investigating a distributed approach to the processor allocation problem in large mesh-connected multicomputers. A noncontiguous version of a distributed dynamic processor allocation
Research Interests:
Research Interests:
Research Interests:
ABSTRACT Cloud computing (CC) has become a very popular computing model in the last decade, as it has proved to be a cost-effective alternative to large-scale computers hosted in conventional Information Technologies (IT) department. The... more
ABSTRACT Cloud computing (CC) has become a very popular computing model in the last decade, as it has proved to be a cost-effective alternative to large-scale computers hosted in conventional Information Technologies (IT) department. The ability to provide on-demand IT-related resources either through the internet (public clouds) or private networks (private clouds) based on customer's needs, and the scalability they have to deliver resources horizontally, can be considered the main reasons for such popularity and have led such a CC platforms to a scenario involving the hosting of other types of systems, such as those that control large volume of data, like database management systems (DBMS).
Research Interests:
Cloud computing focuses on delivery of reliable, secure, fault-tolerant, sustainable, and scalable infrastructures for hosting Internet-based application services. These applications have different composition, configuration, and... more
Cloud computing focuses on delivery of reliable, secure, fault-tolerant, sustainable, and scalable infrastructures for hosting Internet-based application services. These applications have different composition, configuration, and deployment requirements. Quantifying the performance of scheduling and allocation policy on a Cloud infrastructure (hardware, software, services) for different application and service models under varying load, energy performance (power consumption, heat dissipation), and system size
Research Interests:
Research Interests:
Research Interests:
Efficient scheduling of Bag-of-Tasks (BoT) applications in a computational grid environment reveals several challenges due to its high heterogeneity, dynamic behavior, and space shared utilization. Currently, most of the scheduling... more
Efficient scheduling of Bag-of-Tasks (BoT) applications in a computational grid environment reveals several challenges due to its high heterogeneity, dynamic behavior, and space shared utilization. Currently, most of the scheduling algorithms proposed in the literature use a master-oriented algorithm, in which the master is the only responsible for choosing the best task size to send to each slave. We present
Research Interests:
Research Interests:
Research Interests:
SUMMARY Distributed systems such as grids are composed of geographically distributed computing elements that belong to multiple administrative domains and are controlled by multiple entities. Then, it is unlikely that testers are able to... more
SUMMARY Distributed systems such as grids are composed of geographically distributed computing elements that belong to multiple administrative domains and are controlled by multiple entities. Then, it is unlikely that testers are able to acquire repeatedly the same resources, for the same amount of time, and under the same network conditions, which are paramount requirements for enabling reproducible and controlled
Research Interests:
Research Interests:
Current processor allocation techniques for highly parallel systems use centralized front-end based algorithms which restrict applied strategies to static allocation, low parallelism, and weak fault tolerance. To lift these restrictions,... more
Current processor allocation techniques for highly parallel systems use centralized front-end based algorithms which restrict applied strategies to static allocation, low parallelism, and weak fault tolerance. To lift these restrictions, we are investigating a distributed approach to processor allocation in multicomputers where currently no centralized data structure with information about the state of all processors exists. This approach will allow
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Parallel processing may help obtaining animations in shorter time or achieving better quality of the images generated through the simulation of particles systems, due to the parallel nature of particles. This work presents a model that... more
Parallel processing may help obtaining animations in shorter time or achieving better quality of the images generated through the simulation of particles systems, due to the parallel nature of particles. This work presents a model that aims to assist users on the use of clusters, especially heterogeneous ones, on the creation process of simulations with several particle systems. The model
Research Interests:
Research Interests:
Research Interests:
In general, two types of resource reservations in com-puter networks can be distinguished: immediate reserva-tions which are made in a just-in-time manner and advance reservations which allow to reserve resources a long time before they... more
In general, two types of resource reservations in com-puter networks can be distinguished: immediate reserva-tions which are made in a just-in-time manner and advance reservations which allow to reserve resources a long time before they are actually used. Advance reservations are ...
Research Interests:
Research Interests:
In this paper we discuss the difficulties involved in the scheduling of applications on computational grids. We highlight two main sources of difficulties: 1) the size of the grid rules out the possibility of using a centralized... more
In this paper we discuss the difficulties involved in the scheduling of applications on computational grids. We highlight two main sources of difficulties: 1) the size of the grid rules out the possibility of using a centralized scheduler; 2) since resources are managed by different parties, the scheduler must consider several different policies. Thus, we argue that scheduling applications on a grid require the orchestration of several schedulers, with possibly conflicting goals. We discuss how we have addressed this issue in the context of ...