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.
High performance applications such as gene sequence alignment searching, data mining, graphics rendering and Monte Carlo simulations in finance and science are putting ever-increasing load on computing infrastructure. Traditionally, such pleasingly parallel workloads are parallelized using standard batch scheduling or, on a larger scale, web-service-based grid middleware, which is traditionally based...
A novel batch system for high throughput computing is presented. The system is specifically designed to leverage virtualization and web technology to facilitate deployment on cloud and other ephemeral resources. In particular, it implements a security model suited for forming collaborations on demand, across organizational boundaries. Other features include firewall-friendliness, integrated software...
In traditional distributed computing systems a few user types are found having rather "flat" profiles, mainly due to the same administrative domain the users belong to. This is quite different in Computational Grids (CGs) in which several user types should co-exist and make use of resources according to hierarchical nature and the presence of the multiple administrative domains. One implication...
Task scheduling and resource allocation are the crucial issues in any large scale distributed system, such as Computational Grids (CGs). However, traditional computational models and resolution methods cannot effectively tackle the complex nature of Grid, where the resources and users belong to many administrative domains with their own access policies, users' privileges, etc. Recently, researchers...
At present, most Ad Hoc grid task scheduling algorithms ignore the impact of trust mechanism, resulting in the potential dangerous in the real scheduling. In this paper, the trust model is defined, which satisfies the tasks' trust demands, in order to choose the suitable resource node to be executed in the scheduling. Moreover, a task scheduling algorithm extended from Min-Min algorithm (T-Min-Min)...
For the task scheduling problem in the heterogeneous grid environment, a security benefit function is constructed by considering the task scheduling demand for confidentiality, integrity and authenticity. Then, according to the history behavior of grid resource nodes, node's credibility dynamic evaluation method is proposed by using the weighted function. Based on these, a new grid task security scheduling...
The last few years have witnessed huge growth in computer technology and available resources throughout the Internet. These resources can be used to run CPU-intensive applications requiring long periods of processing time. Grid systems allow us to take advantage of available resources lying over a network. However, these systems impose several difficulties to their usage (e.g. heavy authentication...
Scheduling independent tasks in Computational Grids commonly arises in many Grid-enabled large scale applications. Much of current research in this domain is focused on the improvement of the efficiency of the Grid schedulers, both at global and local levels, which is the basis for Grid systems to leverage large computing capacities. However, unlike traditional scheduling, in Grid systems security...
Data grids provide such data-intensive applications with a large virtual storage framework with unlimited power. However, conventional scheduling algorithms for data grids are unable to meet the reputation service requirements of data-intensive applications. In this paper we address the problem of scheduling data-intensive jobs on data grids subject to reputation service constraints. Using the reputation-aware...
Task scheduling in dynamic, heterogeneous and distributed grid environments is a complex and challenging issue. On the basis of multi-objective genetic algorithm NSGA-II, the chromosome coding schema is proposed. Also, this paper presents the generating method for the initial population and the genetic operators such as selection, crossover and mutation. The experimental results show that the proposed...
Task scheduling and quality of service (QoS) are two curial problems in grid computing. Focusing on the meta-task with QoS requirements, this work presents an ant colony optimization for grid task scheduling with multiple QoS dimensions (QACO). The proposed algorithm considers five kinds of QoS dimensions: time, reliability, version, security and priority which are transformed to utility as the heuristic...
Currently, computational grid, service grid and data grid are becoming richer and more complex. Grid infrastructure composed of heterogeneous resource is widely distributed, workflow scheduling problem in grid environment described by directed acrylic graph (DAG) becomes an important and difficult problem. Meanwhile, the research on workflow scheduling problem in grid environment mainly focuses on...
The coordination and scheduling of affiliated tasks to be run at different sites is a challenging problem, specifically in the domain of network performance monitoring. This paper presents a software implementation of the probes coordination protocol (PCP) which provides a solution to this problem. The PCP allows tasks to be executed regularly on a multitude of sites without the need for repeated...
The distributed computing system researches are active in various areas. It is the system to perform the operation in the various areas, for example, science and art and cryptography. We present security mechanism consisted of three phases: the simple authentication, the strong authentication and the rapid authentication. Additionally we designed the mechanism of scheduling for multi-job operation...
It has always been a great deal to balance both security and performance. But here we have presented a scenario in which a local scheduler of a networked system can schedule its jobs on and across other systems in the network securely. There by creating an environment in which no system is idle when even two systems are communicating. This clubs both distributed computing and load sharing. Thus high...
For a class of real-time scheduling problems with the time constraints, both the time constraints and the security performance are considered in this paper. Firstly, a security-efficiency function is proposed, and a new security-driven task scheduling model is constructed based on the function. Secondly, a new selection operator is proposed, where some individuals not satisfying time constraints but...
In this paper, by introducing the conception of QoS matching offset between tasks and resources in grid scheduling tasks are able to be allocated on demand. Meanwhile, we take into consideration the utility of trust QoS between tasks and resources in the scheduling. Therefore, job schedule algorithm TD_QMO (trust-driven QoS matching offset) based on trust driven is presented for computing grid. The...
The following topics are dealt with: parallel and distributed computing; task scheduling and load balancing; formal verification; parallel programming; embedded systems and architectures; grid computing; mobile computing and security.
Grids and peer-to-peer (P2P) networks have emerged as popular platforms for the next generation parallel and distributed computing. In these environments, resources are geographically distributed, managed and owned by various organizations with different policies, and interconnected by wide-area networks or the Internet. This introduces a number of resource management and application scheduling challenges...
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.