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.
In peer-to-peer (P2P) grids, peers act both as providers and consumers of the services offered in the system. In these systems, fair and efficient match of service request and service provision can be attained by using simple reciprocation-based mechanisms. Under contention, a peer p gives priority to serve the requests of the peers that have the largest difference between the amount of service provided...
Cloud/Grid environments are characterized by a diverse set of technologies used for communication, execution and management. Service Providers, in this context, need to be equipped with an automated process in order to optimize service provisioning through advanced performance prediction methods. Furthermore, existing software solutions such as GNU Octave offer a wide range of possibilities for implementing...
Grid networks take advantage of the resources available by many computers connected within the network to solve large-scale computational problems. To achieve a scalable and reliable Grid network system, the workload needs to be efficiently distributed among the computing resources accessible on the network. Therefore, a distributed and scalable load-balancing scheme for Grid Networks is proposed...
The widespread application of manufacturing grid technology has already caused each kind of manufacturing resources which dispersed in the different zones and enterprises, organized effectively, that enables the user to be able to obtain each kind of manufacturing services. But aims in how to discover and schedule the resources fastly and accurately in the complex environment of the manufacturing...
This paper proposes a new control structure for automatic production lines. To handle the production lines flexibility and to solve the optimal control problem a new methodology is suggested. In our approach the production line workstations are connected sequential, coordinated and controlled with individual (industrial) Personal Computers (PCs) interconnected in grid. These computers are able to...
Grid systems are developed in very dynamic and heterogeneous environments, characterized by an high level of unpredictability. Some system performance, in fact, may vary due to sudden failures or to the occurrence of circumstances unforeseeable deterministically (e.g. failure of the machines, load higher than the expected and inaccuracy in the estimation of parameters). The presence of a robust scheduling...
This paper presents a system of systems approach to implement high-speed searching to solve complex optimization problems. In most optimization techniques, parallel computation is not effective due to the complexity in algorithm. Here, the search space is distributed within processing power of high performance computing resources. The methodology takes advantage of the Bees Algorithm and adapts it...
We consider the Molecular Distance Geometry Problem (MDGP), which is the problem of finding the conformation of a molecule from some known distances between its atoms. Such distances can be estimated by performing experiments of Nuclear Magnetic Resonance (NMR). Unfortunately, data obtained during these experiments are usually noisy and affected by errors. In particular, some of the estimated distances...
This paper proposes a new method: PCA- Optimal SVM model which is composed of PCA and Optimal SVM to optimize the allocation of manufacturing grid resources through resources allocation data. The model is fit for company in the small sample space. It uses PCA to predigest the input vector and uses Optimal SVM to judge the statement of the company resources. With the model, one or more enterprises...
Grid computing collects geographically dispersed resources ranging from laptops to supercomputers to compute tasks requested by clients. Grid scheduling, i.e., assigning tasks to resources, is an NP-hard problem, and thus, metaheuristic methods are employed to find the optimal solutions. In this paper, we propose a Chemical Reaction Optimization (CRO) algorithm for the grid scheduling problem. CRO...
There is a critical need to develop new programming paradigms for grid middleware tools and applications to harness the opportunities presented by emerging multi-core processors. Implementations of grid middleware and applications that do not adapt to the programming paradigm when executing on emerging processors can severely impact the overall performance. In this paper we focus on the utilization...
A new numerically efficient global optimization algorithm utilizing grid computing technique and surrogate objective function (SOF) is developed. The algorithm combines particles swarm optimization (PSO) with a SOF constructed by using Multi-quadric radial basis function. For the computation of the objective function values for sampling points, grid computing technique is adopted employing the same...
Conjugate Gradient is an iterative linear solver that is used in many scientific and engineering applications to solve a system of linear equations. However, Conjugate Gradient generates a heavy load of computation and therefore it slows the performance of the applications using it. In this paper, we conduct an empirical cost study of a parallel CG on our star-based network. We evaluate the communication...
In order to better solve the problem of distributed query optimization, a querying optimization algorithm on GEP (QO-GEP) is present. On the basis of QO-GEP, distributed GEP query optimization on grid service (DGEPQO-GS) is proposed which combines with grid service. Simulated experiments shows that with the increment of the number of query relation, query time which QO-GEP carries out querying decreases...
In the process of a scientific experiment a workflow is executed multiple times using various values of the parameters of activities. For real-world workflows that may contain hundreds of activities, each having several parameters, it is practically not feasible to conduct a parameter sensitivity study by simply following a ”brute-force approach” (that is experimental evaluation of all possible cases)...
We propose a suite of market-oriented task scheduling algorithms to build an AuctionNet for heterogeneous distributed environments. In heterogeneous distributed environments, computing nodes are autonomous and owned by different organizations, for example peer-to-peer systems, desktop grids/clouds. To address such diverse heterogeneity and dynamism in systems, applications, and local policies, efficient...
A major problem in mobile computing is the optimal replication and location of data files in the Grid sites, in order to improve and maintain over time a high overall throughput of Grid jobs that access files. Therefore, a Grid optimization service should be able to dynamically modify the geographic distribution of data files, triggering file replication and location, according to the variation over...
On the basis of author's former work, this paper presents an improved ant colony algorithm, namely adaptive ant colony algorithm. In the proposed algorithm, the value of evaporation rate ?? is adaptively changed and a minimum value ??min is assigned. Thereby, the evaporation rate ?? is under control and will never be reduced to 0. Then the paper applies the proposed algorithm to grid task scheduling...
Focusing on the problem of resource allocation under large-scale, distributed, autonomous, heterogeneous and dynamic environments in grid computing, a heuristic algorithm combining fuzzy clustering with application preference is proposed. Fuzzy clustering method is applied according to a group of features, which describe the user's application preference, to realize reasonable pre-classification resource...
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.