Search Results - (( grid computing ((data algorithm) OR (_ algorithm)) ) OR ( java implication based algorithm ))
Search alternatives:
- implication based »
- java implication »
- data algorithm »
-
1
Data discovery algorithm for scientific data grid environment
Published 2005Subjects: Get full text
Get full text
Get full text
Article -
2
Relationship based replication algorithm for data grid
Published 2014“…Data Grid is an infrastructure that manages huge amount of data files and provides intensive computational resources across geographically distributed systems.To increase resource availability and to ease resource sharing in such environment, there is a need for replication services.This research proposes a replication algorithm, termed as Relationship based Replication (RBR) that integrates users, grid and system perspective.In particular, the RBR includes information of three different relationships in identifying file(s) that requires replication; file-to-user, file-to-file and file-to-grid. …”
Get full text
Get full text
Monograph -
3
Heuristic task scheduling algorithms for optimal resource utilisation in grid computing
Published 2020“…The main goal of this work is to present an evaluation of resources utilisation for certain heuristic scheduling algorithms in Grid Computing Environment. The results of the two experimental scenarios showed that suf rage algorithm produced the best resource utilisation among the three investigated heuristic scheduling algorithms.…”
Get full text
Get full text
Get full text
Article -
4
COMPARATIVE PERFORMANCE OF SOME HYBRID HEURISTICS SCHEDULING ALGORITHMS BASED ON SLTR AND DEADLINE FOR COMPUTATIONAL GRID
Published 2013“…Grid scheduling is an essential element of a Computational Grid infrastructure. …”
Get full text
Get full text
Thesis -
5
Improved genetic algorithm for scheduling divisible data grid application
Published 2007“…In this paper, we exploit this property and propose an Improved Genetic Algorithm (IGA) for scheduling divisible data grid applications. …”
Get full text
Get full text
Conference or Workshop Item -
6
The comparison of tardiness in scheduling techniques for task distribution using grid simulation tool
Published 2008“…Today scheduling in Grid computing involves much static and fix algorithm. …”
Get full text
Get full text
Get full text
Thesis -
7
Big data clustering using grid computing and ant-based algorithm
Published 2013Get full text
Get full text
Get full text
Conference or Workshop Item -
8
Replica Creation Algorithm for Data Grids
Published 2012“…This thesis presents a new replication algorithm that improves data access performance in data grids by distributing relevant data copies around the grid. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
9
A dynamic replication aware load balanced scheduling for data grids in distributed environments of internet of things
Published 2018“…Grid computing is a powerful distributed and scalable computing infrastructure that deals with massive data-intensive applications. …”
Get full text
Get full text
Article -
10
Max-average: an extended max-min scheduling algorithm for Grid computing environtment
Published 2016“…This paper presents a new proposed grid based scheduling algorithm called Max-Average, inspired from Max-Min algorithm. …”
Get full text
Get full text
Get full text
Article -
11
Simulated annealing algorithm for scheduling divisible load in large scale data grids
Published 2008Get full text
Get full text
Conference or Workshop Item -
12
Implementation of Grid Computing for Cryptosystem (RSA)
Published 2005“…One objective ofthis project is to perform a small scale study in order to set up a grid computing that can support faster computation ofRSA Algorithm. …”
Get full text
Get full text
Final Year Project -
13
A novel binary vote assignment grid quorum algorithm for distributed database fragmentation
Published 2011Get full text
Get full text
Get full text
Conference or Workshop Item -
14
Survey on job scheduling mechanisms in grid environment
Published 2015“…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
Get full text
Get full text
Get full text
Article -
15
A cluster-based hybrid replica control protocol for high availability in data grid
Published 2019“…Data Grid provides a scalable infrastructure for managing and storing large amount of data files in Grid computing system. …”
Get full text
Get full text
Thesis -
16
An adaptive density-based method for clustering evolving data streams / Amineh Amini
Published 2014“…This study proposes a density-based algorithm for clustering evolving data streams. The proposed method, which is called MuDi-Stream (Multi Density clustering algorithm for evolving data Stream), is an online-offline algorithm with four main components. …”
Get full text
Get full text
Get full text
Thesis -
17
Dynamic replication aware load blanced scheduling in distributed environment / Said Bakhshad
Published 2018“…Grid computing is an effective distributed and adaptable processing network that manages a huge number of data applications. …”
Get full text
Get full text
Get full text
Thesis -
18
Green scheduling algorithm for a computational grid environment
Published 2016“…Recently, the increasing demand for computing has led to the development of computational grids. …”
Get full text
Get full text
Conference or Workshop Item -
19
Dynamic replication algorithm in data grid: Survey
Published 2008“…Data Grid is an infrastructure that manages huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. …”
Get full text
Get full text
Get full text
Book Section -
20
Using Economic Model To Improve The Performance Of BHR Dynamic Replication Algorithm.
Published 2007Get full text
Get full text
Conference or Workshop Item
