Browse Prior Art Database

A Method for Job Assignment to Distributed Resource Using Resource Scope and Job Workflow

IP.com Disclosure Number: IPCOM000021672D
Original Publication Date: 2004-Feb-02
Included in the Prior Art Database: 2004-Feb-02
Document File: 1 page(s) / 11K

Publishing Venue

IBM

Abstract

A program is disclosed that analyzes job workflows to determine costs of resources assignment. A program finds a node which can perform workflows as much as log steps to reduce data transfer overhead by using resource scopes. Resource scopes define sets of nodes which reflect constraint for performing each job in a workflow.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 51% of the total text.

Page 1 of 1

A Method for Job Assignment to Distributed Resource Using Resource Scope and Job Workflow

A program is disclosed that analyzes job workflows to determine costs of resources assignment. A program finds a node which can perform workflows as much as log steps to reduce data transfer overhead by using resource scopes. Resource scopes define sets of nodes which reflect constraint for performing each job in a workflow.

Directed acyclic graph represents a job workflow. A job workflow contains nodes and arrows. The nodes represent jobs and arrows represent dependency of jobs. The dependency between applications means that output data of a job is input data for another job. There is various types of nodes. Some nodes can perform all jobs in a workflow. Some nodes can only perform some of jobs in a workflow. It is constraints of job execution on a node. A program assigns a node which can execute jobs in short time. But there is ambiguity of selecting nodes when their specs are almost same. A program selects a node which can minimize possibility of data transfer. The overhead depend on the structure of workflows. A program analyzes workflows by using resource scopes. The resources scope defines sets of nodes which is reflecting constraints of job execution. All nodes in a scope can perform sub set of jobs or all of jobs. All nodes in a cope satisfy same constraint. A program solves the matching between workflows and resource scopes. There are many paths which traverse from a top node to leaf node in directed acyclic graph . A path defines a sequence of jobs. A program assigns the first job in the job sequence to a node which belongs to a scope satisfying the constraints to perform the first job. There are many nodes in such a scope. A program anal...