Today, we observe that more and more, radio frequency identification (RFID) technology has been used to identify and track objects in enterprises and institutions. In addition, we also perceive the growing adoption of cloud computing, either public or private, to process and store data from the objects. In this context, the literature does not present an initiative that looks into the network on enterprise-cloud interactions, so neglecting network performance and congestion information when transmitting data to the cloud. Thus, we are presenting a model named ACMA—Automatic Control and Management of Assets. ACMA employs context awareness to control and monitor corporate assets in companies with multiple units. ACMA provides a centralized point of access in the cloud in which interested actors can get online data about each corporate asset. In particular, our scientific contribution consists in considering network congestion to control dynamically the data updating interval from sensors to the cloud. The idea is to search for reliability and integrity of operations, without losing or corrupting data when updating the information to cloud. Thus, this article describes the ACMA model, its architecture, algorithms and features. In addition, we describe the evaluation methodology and the results obtained through experiments and simulations based on the developed prototype.

In recent years, there has been growing support for more tightly coupled applications regarding heterogeneous resources. A specific way of obtaining better performance in such applications is to consider the replacement of execution entities by newer resources during the application's lifetime. Therefore, this article describes the rationale for developing jMigBSP, which is a Java programming library that offers object rescheduling for round-based applications. In this context, the proposal addresses Bulk Synchronous Parallel (BSP) applications because BSP represents one of the most often used models for writing tightly coupled parallel programs. jMigBSP's main contribution examines the rescheduling facility in two different ways: (i) using migration directives in the application code directly; and (ii) through automatic load balancing at the middleware level. Specifically, this second idea is feasible because of Java's inheritance feature, which transforms a simple jMigBSP application into a migratable one by changing only a single line of code. In addition to the description of jMigBSP, this article emphasizes the benefits of using migration over heterogeneous environments by executing scientific applications. The results indicate gains of up to 56% with object rescheduling and support the feasibility of using migration as a load balancing technique. Copyright © 2014 John Wiley & Sons, Ltd.

Este artigo tem como objetivo apresentar as idéias para o desenvolvimento de um framework para balanceamento de carga chamado GetLB. Considerando o contexto de transferência eletrônica de fundos (TEF), GetLB oferece uma nova forma de organizar as interações entre o chaveador e as máquinas processadoras. Esta organização permite que o chaveador combine informações atualizadas para a execução de um algoritmo de programação dinâmica em vez de usar a abordagem Round-Robin entre as máquinas de processamento. O algoritmo de agendamento de GetLB divide as transações em diferentes tipos, combinando suas necessidades de CPU, memória e disco de dados de máquinas processadoras para oferecer um balanceamento de carga eficiente. Implementou-se um protótipo com RMI e testes revelaram que o quadro é viável para processamento de transações sobre os ambientes homogêneos e heterogêneos. Além disso, a avaliação apresentou as vantagens da adoção de algoritmos GetLB em vez da abordagem Round-Robin tradicional.

The use of electronic medias for payment has been increasingly adopted, instead of employing money in currency paper or check directly. Considering this electronic funds transfer (EFT) scenario, we developed a model called GetLB which comprises not only a completely new and efficient scheduler but also a cooperative communication infrastructure for handling heterogeneous and dynamic environments. The scientific contribution consists of a scheduling heuristic that combines static data from transactions and dynamic one from processing nodes to overcome the limitations of Round-Robin. Besides the GetLB's description, this article also presents a prototype evaluation by using both traces and configurations obtained with a real EFT company.

This article describes the rationales for developing jMigBSP - a Java programming library that offers object rescheduling. It was designed to work on grid computing environments and offers an interface that follows the BSP (Bulk Synchronous Parallel) style. jMigBSP’s main contribution focuses on the rescheduling facility in two different ways: (i) by using migration directives on the application coded irectly and (ii) through automatic load balancing at middleware level. Especially, this second idea is feasible thanks to the Java’s inheritance feature, in which transforms a simple jMigBSP application in amigratable one only by changing a single line of code. In addition, the presented library makes the object interaction easier by providing one-sided message passing directives and hides network latency through asynchronous communications. Finally, we developed three BSP applications: (i) Prefix Sum; (ii) Fractal Image Compression (FIC) and; (iii) Fast Fourier Transform (FFT).They show our library as viable solution to offer load balancing on BSP applications. Specially, the FIC results present gains up to 37% when applying migration directives inside the code. Finally, the FFT tests emphasize strength of jMigBSP. In this situation, it outperforms a native library denoted BSPlib when migration facilities take place.Keywords: Bulk Synchronous Parallel, rescheduling, Java, adaptation, object migration, grid computing.

Scheduling is an important tool for manufacturing and engineering, where it can have a major impact on the productivity of a process (Min et al., 2009). In manufacturing, the purpose of production scheduling is to minimize the production time and costs, by informing a production facility when to make, with which staff, and on which equipment (Zhu et al., 2011). Nowadays, it is possible to observe the use of specific computational tools for production scheduling in which greatly outperform older manual scheduling methods. These tools implement mathematical programming methods that model the problem as an optimization issue where some objective, e.g. total duration, must be minimized (or yet maximized) (Yao & Zhu, 2010).

In this paper we present MigBSP, a rescheduling mo- del that acts on Bulk Synchronous Parallel applications. It combines the metrics Computation, Communication and Memory to make migration decisions on Computation Grids. MigBSP also offers efficient adaptations to reduce its own overhead. Additionally, MigBSP is infrastructure and application independent and tries to handle dynamicity on both levels. MigBSP's results show performance gains of up to 16% on dynamic environments while maintaining a small overhead when migrations do not take place.

This paper describes the rationale for developing jMigBSP - a Java programming library that offers object rescheduling. It was designed to work on grid computing environments and offers an interface that follows the BSP (Bulk Synchronous Parallel) style. jMigBSP's main contribution focuses on the rescheduling facility in two different ways: (i) by using migration directives on the application code directly and (ii) through automatic load balancing at middleware level. Especially, this second idea is feasible thanks to the Java's inheritance feature, in which transforms a simple jMigBSP application in a migratable one only by changing a single line of code. In addition, the presented library makes the object interaction easier by providing one-sided message passing directives and hides network latency through asynchronous communications. Finally, a BSP-based FFT application was developed and its execution shows jMigBSP as a competitive library when comparing performance with a C-based library called BSPlib. Besides its user-friendly Java interface, the strengths of jMigBSP also considers the migration tests where it outperforms the time spent with BSPlib.

This article discusses MigBSP: a rescheduling model that acts on Bulk Synchronous Parallel applications running over computational Grids. It combines the metrics Computation, Communication and Memory to make migration decisions. MigBSP also offers efficient adaptations to reduce its overhead. Additionally, MigBSP is infrastructure and application independent and tries to handle dynamicity on both levels. MigBSP's results show application performance improvements of up to 16% on dynamic environments while maintaining a small overhead when migrations do not take place.

The purpose of the work is to became available on the web, informations from the database of the project GIS/FM in the Feevale, to virtual navegation in the Campi of the institute to help the internal and external community to know the spaces and infrastructural of the classes and localization of the spaces in the Campi. The page has information of the maps of the localization the University. In this page the people can visualize the Campi and it is possible to see the buildings, the classes, labora- tory and the other services to the students. About the classes it has information of the area, capacity of the students, climatization (air conditioned or not), whiteboard or greenboard and other informa- tions. New students can find on the web the localization of their classes and the academic adminis- tration can visualize the capacity of students in the classes. The informations of the database are updated on-line. The available of the database from the project GIS/FM on the web is very good to the integration with the academic community to optimize the locomotion and its very important to help the academic administration in their decision of distribution of the students in the classes.