scholarly journals The AppLeS Parameter Sweep Template: User-Level Middleware for the Grid

2000 ◽  
Vol 8 (3) ◽  
pp. 111-126 ◽  
Author(s):  
Henri Casanova ◽  
Graziano Obertelli ◽  
Francine Berman ◽  
Richard Wolski
Keyword(s):  
Shared Resources ◽  
Performance Potential ◽  
Parameter Spaces ◽  
Grid Middleware ◽  
Shared Data ◽  
Current Implementation ◽  
Data Files ◽  
Level Scheduling ◽  
Grid Resources ◽  
Application Execution

The Computational Grid is a promising platform for the efficient execution ofparameter sweep applicationsover large parameter spaces. To achieve performance on the Grid, such applications must be scheduled so that shared data files are strategically placed to maximize re-use, and so that the application execution can adapt to the deliverable performance potential of target heterogeneous, distributed and shared resources. Parameter sweep applications are an important class of applications and would greatly benefit from the development ofGrid middlewarethat embeds a scheduler for performance and targets Grid resources transparently. In this paper we describe a user-level Grid middleware project, the AppLeS Parameter Sweep Template (APST), that uses application-level scheduling techniques [1] and various Grid technologies to allow the efficient deployment of parameter sweep applications over the Grid. We discuss several possible scheduling algorithms and detail our software design. We then describe our current implementation of APST using systems like Globus [2], NetSolve [3] and the Network Weather Service [4], and present experimental results.

Memory-Aware Scheduling Parallel Real-Time Tasks for Multicore Systems

2021 ◽  
Vol 31 (04) ◽  
pp. 613-634
Author(s):  
Zhenyang Lei ◽  
Xiangdong Lei ◽  
Jun Long
Keyword(s):  
Real Time ◽  
Data Access ◽  
Main Memory ◽  
Second Phase ◽  
Shared Resources ◽  
Access Memory ◽  
Worst Case ◽  
Scheduling Policy ◽  
The Core ◽  
Level Scheduling

Shared resources on the multicore chip, such as main memory, are increasingly becoming a point of contention. Traditional real-time task scheduling policies focus on solely on the CPU, and do not take in account memory access and cache effects. In this paper, we propose parallel real-time tasks scheduling (PRTTS) policy on multicore platforms. Each set of tasks is represented as a directed acyclic graph (DAG). The priorities of tasks are assigned according to task periods Rate Monotonic (RM). Each task is composed of three phases. The first phase is read memory stage, the second phase is execution phase and the third phase is write memory phase. The tasks use locks and critical sections to protect data access. The global scheduler maintains the task pool in which tasks are ready to be executed which can run on any core. PRTTS scheduling policy consists of two levels: the first level scheduling schedules ready real-time tasks in the task pool to cores, and the second level scheduling schedules real-time tasks on cores. Tasks can preempt the core on running tasks of low priority. The priorities of tasks which want to access memory are dynamically increased above all tasks that do not access memory. When the data accessed by a task is in the cache, the priority of the task is raised to the highest priority, and the task is scheduled immediately to preempt the core on running the task not accessing memory. After accessing memory, the priority of these tasks is restored to the original priority and these tasks are pended, the preempted task continues to run on the core. This paper analyzes the schedulability of PRTTS scheduling policy. We derive an upper-bound on the worst-case response-time for parallel real-time tasks. A series of extensive simulation experiments have been performed to evaluate the performance of proposed PRTTS scheduling policy. The results of simulation experiment show that PRTTS scheduling policy offers better performance in terms of core utilization and schedulability rate of tasks.

Credential Management Enforcement and Secure Data Storage in gLite

2010 ◽  
Vol 1 (1) ◽  
pp. 76-97
Author(s):  
Francesco Tusa ◽  
Massimo Villari ◽  
Antonio Puliafito
Keyword(s):  
Data Storage ◽  
Grid Security ◽  
Business Services ◽  
Grid Middleware ◽  
File Storage ◽  
Secure Data ◽  
Secure Data Transmission ◽  
Security Infrastructure ◽  
New Processing ◽  
Grid Resources

This article describes new security solutions for Grid middleware, and specifically faces the issues related to the management of users’ and servers’ credentials, together with storing and secure data transmission in the Grid. Our work, built on Grid Security Infrastructure (GSI), provides new capabilities (i.e. smart card Grid access, and strong security file storage XML-based) to be used on top of different Grid middlewares, with a low level of changes. This work is currently implemented on gLite and accomplishes the access to Grid resources in a uniform and transparent way. These improvements enable the Grid computing toward the new processing model known as business services.

scholarly journals Secured Policy based Resource Access and User Authentication in Ubiquitous Computing Environment

2019 ◽  
Vol 9 (1) ◽  
pp. 1836-1841
Keyword(s):  
Ad Hoc ◽  
User Authentication ◽  
Computing Environment ◽  
Shared Resources ◽  
Resource Access ◽  
Access Policy ◽  
Context Aware Computing ◽  
Security Issues ◽  
Shared Data ◽  
Ubiquitous Environment

Policy-based resource access and data sharing are the most specific in context-aware computing. Granting authentication to the wireless and ad hoc users is usually difficult because the system has got to take into account several context factors whereas authoring access. During this epoch, the mobile phone plays a significant role in info access in a ubiquitous environment. Wireless technologies, significantly the GSM-SMS is efficient and efficient to access shared data around the world with fewer security issues. The shared resources like printers, scanners, databases, books, email, etc. are liable to the users once they try and access with proper authentication. The proposed system provides systematic access policy schemes and creates the access mechanism to remote users. These policies and mechanisms are entirely supported context info. The user should satisfy the defined context and defined the user level. This mechanism provides the facilities to users to request and access control through SMS.

scholarly journals Trust Management for Grid Systems

2010 ◽  
pp. 149-178
Author(s):  
Benjamin Aziz ◽  
Alvaro Arenas ◽  
Fabio Martinelli ◽  
Paolo Mori ◽  
Marinella Petrocchi
Keyword(s):  
Grid Computing ◽  
Trust Management ◽  
Large Scale ◽  
Distributed Computation ◽  
Shared Resources ◽  
Grid Systems ◽  
Grid Middleware ◽  
Grid Environments ◽  
Administrative Domains ◽  
Heterogeneous Resources

Grid computing is a paradigm for distributed computation on shared resources. It uses a large-scale, highly decentralized infrastructure, in which a huge number of participants share heterogeneous resources for a given purpose. Each participant both provides their own resources and exploits others’ resources, combining them to solve their own problems. Trust management is a major issue in the shared Grid environment because Grid participants are usually unknown to each other and usually belong to separate administrative domains, with little or no common trust in the security of opposite infrastructures. The standard security support provided by the most common Grid middleware may be regarded as one means through which such common trust may be established. However, such security solutions are insufficient to exhaustively address all the trust requirements of Grid environments. In this chapter, the authors survey proposals for enhancing trust management in Grid systems.

Credential Management Enforcement and Secure Data Storage in gLite

2012 ◽  
pp. 956-978
Author(s):  
Francesco Tusa ◽  
Massimo Villari ◽  
Antonio Puliafito
Keyword(s):  
Data Storage ◽  
Grid Security ◽  
Business Services ◽  
Grid Middleware ◽  
File Storage ◽  
Secure Data ◽  
Secure Data Transmission ◽  
Security Infrastructure ◽  
New Processing ◽  
Grid Resources

This article describes new security solutions for Grid middleware, and specifically faces the issues related to the management of users’ and servers’ credentials, together with storing and secure data transmission in the Grid. Our work, built on Grid Security Infrastructure (GSI), provides new capabilities (i.e. smart card Grid access, and strong security file storage XML-based) to be used on top of different Grid middlewares, with a low level of changes. This work is currently implemented on gLite and accomplishes the access to Grid resources in a uniform and transparent way. These improvements enable the Grid computing toward the new processing model known as business services.

scholarly journals Optimizing Job Coscheduling by Adaptive Deadlock-Free Scheduler

2018 ◽  
Vol 2018 ◽  
pp. 1-18
Author(s):  
Zhishuo Zheng ◽  
Deyu Qi ◽  
Mincong Yu ◽  
Xinyang Wang ◽  
Naqin Zhou ◽  
...  
Keyword(s):  
Resource Competition ◽  
Control Mechanism ◽  
Performance Degradation ◽  
Flexible Scheduling ◽  
Challenging Problem ◽  
Shared Resources ◽  
Automated Control ◽  
Resource Information ◽  
Level Scheduling ◽  
Present Simulation

It is ubiquitous that multiple jobs coexist on the same machine, because tens or hundreds of cores are able to reside on the same chip. To run multiple jobs efficiently, the schedulers should provide flexible scheduling logic. Besides, corunning jobs may compete for the shared resources, which may lead to performance degradation. While many scheduling algorithms have been proposed for supporting different scheduling logic schemes and alleviating this contention, job coscheduling without performance degradation on the same machine remains a challenging problem. In this paper, we propose a novel adaptive deadlock-free scheduler, which provides flexible scheduling logic schemes and adopts optimistic lock control mechanism to coordinate resource competition among corunning jobs. This scheduler exposes all underlying resource information to corunning jobs and gives them necessary utensils to make use of that information to compete resource in a free-for-all manner. To further relieve performance degradation of coscheduling, this scheduler enables the automated control over the number of active utensils when frequent conflict becomes the performance bottleneck. We justify our adaptive deadlock-free scheduling and present simulation results for synthetic and real-world workloads, in which we compare our proposed scheduler with two prevalent schedulers. It indicates that our proposed approach outperforms the compared schedulers in scheduling efficiency and scalability. Our results also manifest that the adaptive deadlock-free control facilitates significant improvements on the parallelism of node-level scheduling and the performance for workloads.

scholarly journals Application execution management on the InteGrade opportunistic grid middleware

2010 ◽  
Vol 70 (5) ◽  
pp. 573-583 ◽  
Author(s):  
Francisco José da Silva e Silva ◽  
Fabio Kon ◽  
Alfredo Goldman ◽  
Marcelo Finger ◽  
Raphael Y. de Camargo ◽  
...  
Keyword(s):  
Grid Middleware ◽  
Execution Management ◽  
Application Execution

SCHEDULING AND MANAGEMENT OF VIRTUAL RESOURCES IN GRID SITES: THE SITE RESOURCE SCHEDULER

2009 ◽  
Vol 19 (01) ◽  
pp. 3-18 ◽  
Author(s):  
RODRIGO N. CALHEIROS ◽  
TIAGO FERRETO ◽  
CÉSAR A. F. DE ROSE
Keyword(s):  
Computational Grids ◽  
Quick Response ◽  
New Approach ◽  
Simulated Performance ◽  
Capacity Measure ◽  
Level Scheduling ◽  
A Site ◽  
Virtual Resources ◽  
Resource Scheduler ◽  
Grid Resources

This paper presents a new approach to resource management and scheduling in computational grids, in order to simplify the vision users have from grid resources and their management. Scheduling decisions are moved to the site where resources are hosted, allowing quick response to changes in load and resource availability. Users do not need to be aware of the resources they use and are instead supplied with "virtual resources" representing the amount of computational power available to them in the site. This approach results in new challenges, like the management of two-level scheduling schema and the need to define a site capacity measure, but simplifies and optimizes scheduling in grids. In this paper we present details of this approach – called Site Resource Scheduler (SRS) – as well as some issues regarding its simulated performance and its deployment in a site. We show that the main advantage of this approach is an overall reduction in the execution time of tasks in most scenarios.

scholarly journals Cloud based Scaling of Grid Resources through Grid Middleware

2013 ◽  
Vol 64 (15) ◽  
pp. 7-11
Author(s):  
Mary SumiKurian ◽  
S. P. Jeno Lovesum
Keyword(s):  
Grid Middleware ◽  
Grid Resources
Sign in / Sign up

Export Citation Format

Share Document