WO2010074554A2 - Method for managing computational resources over a network - Google Patents

Method for managing computational resources over a network Download PDF

Info

Publication number
WO2010074554A2
WO2010074554A2 PCT/MY2009/000216 MY2009000216W WO2010074554A2 WO 2010074554 A2 WO2010074554 A2 WO 2010074554A2 MY 2009000216 W MY2009000216 W MY 2009000216W WO 2010074554 A2 WO2010074554 A2 WO 2010074554A2
Authority
WO
WIPO (PCT)
Prior art keywords
job
host
execution
directory
job execution
Prior art date
Application number
PCT/MY2009/000216
Other languages
French (fr)
Other versions
WO2010074554A3 (en
Inventor
Mohd Sidek Salleh
Mohammad Fairus Khalid
Nazarudin Wijee
Original Assignee
Mimos Berhad
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Mimos Berhad filed Critical Mimos Berhad
Priority to EP09835317A priority Critical patent/EP2370904A4/en
Publication of WO2010074554A2 publication Critical patent/WO2010074554A2/en
Publication of WO2010074554A3 publication Critical patent/WO2010074554A3/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks

Definitions

  • the present invention relates generally to resource management, and more particularly to method for job requests execution in peer-to-peer (P2P) for resource management architecture devoid of file sharing environment.
  • P2P peer-to-peer
  • One of the many significant tasks of in relation to resource management involving a plurality of computing resources is to provide effectual scheduling of predefined tasks among these computing resources over a network. It is principally configured to perform job scheduling for resources on a larger scale, or as mentioned, between multiple computing resources. This particular task therefore entails additional vital tasks such as monitoring the plurality of computer resources and serves as the primary entry point for any jobs or tasks submission.
  • a resource management system comprises of at least one resource management server and a plurality of resource agent components or devices.
  • the resource agent devices are suitably configured to receive the jobs or tasks scheduled by the resource management server and subsequently execute the assigned tasks.
  • the ability of file sharing is therefore preferred within the system purely to eliminate the need of transferring files among the plurality of resources agents or devices, thereby providing time-effective task executing environment.
  • the present invention has been accordingly developed to eliminate said setback and enhance the resource managing system deploying the peer-to-peer (P2P) technology.
  • P2P peer-to-peer
  • P2P peer-to-peer
  • P2P peer-to-peer
  • FIG 2 provides the overall flowchart of the method in accordance with a preferred embodiment of the present invention.
  • the present invention discloses a method for use in managing computational resources within a network comprising the steps of:
  • the present invention focuses on providing an automated stage-in/stage-out file method for use in resource managing, which is a step ahead the prior art, such that the method effectively eliminates the need of file sharing environment in a peer-to-peer (P2P) network.
  • P2P peer-to-peer
  • Peer-to-peer (P2P) connectivity is preferred for operating the tasks based on the method of the present invention due to the advantages such as fast retrieval of data within the interconnected devices upon prompted and aids to reduce inaccuracies in relation to outdated data.
  • FIG 2 provides an overall architecture of the automated file stage-in/stage-out flow configured in accordance with a preferred embodiment of the present invention.
  • the job execution information is gathered (SlOO) from at least three different hosts, these hosts may be in the form of servers, whereby at least one is configured for data submission host, at least one configured for execution host and at least one configured for data execution directory.
  • SlOO job execution information
  • hosts may be in the form of servers, whereby at least one is configured for data submission host, at least one configured for execution host and at least one configured for data execution directory.
  • jobs used within the description include various forms applications, assignments, queues and the likes. Nevertheless, it should be mentioned here that there may be provided only one server for storing all data, and sectionalized into these three categories.
  • the main objective is to provide a centralized unit for storage of data in relation to these categories which may be retrieved or transferred from one host to another when required devoid of the file sharing environment, with the assistance of the peer-to-peer (P2P) technology.
  • job data and information related may be updated automatically and maintained within the servers.
  • the submission host primary purpose is to allow submission of jobs and information related thereto and thereby stores all job submissions whereby stored job submissions may be transferred to other hosts if prompted.
  • Other significant roles which may be performed by this particular include scheduling jobs, reorder and reprioritize jobs.
  • the job submission host may contain all data and input pertaining to job submissions for onward transmission or dispatched to other hosts when necessary.
  • the second server, which is configured for execution host may contain all data and input pertaining to job executions in addition to its main function as the job execution domain for all submitted jobs. It is also noted that the data and information from this host may be transferred to another host upon prompted.
  • the third server is configured to contain all data and input pertaining to executed jobs and applications, and therefore provided in the form of job execution directory. It is understood that all information contained within all three servers may be configured to be retrievable, updated or modified if required. The information gathered based on these servers are used as reference or basis for the file staging purposes, job execution and job monitoring.
  • the job execution directory is created (S200) for a respective job submission.
  • the creation of directory for the job execution request is rather essential for the method of the present invention.
  • Each directory created is unique or specific based on the job execution request and therefore prevents mixed up of information for execution of jobs.
  • all job input and information files related to the directory are transferred (S300) from the submission host to the execution host for proper execution and this step do not require file sharing environment, with the established connectivity provided by the peer-to-peer (P2P) network.
  • the selected job is suitably executed (S400) based on the input files within the job execution directory.
  • the job output are then forwarded and thereby stored based on the created job execution directory.
  • the job execution directory for that particular job together with its content are appropriately archived (S500) and transferred back (S600) from the execution host to the submission host prior to deletion (S700) of the directory and its content, as the final stage which thereby sustaining a non-sharing environment.
  • the present invention provides a method for providing effective and highly efficient resource management within a peer-to- peer (P2P) network.
  • P2P peer-to- peer
  • the present invention may be modified in light of the above teachings. It is therefore understood that, within the scope of the appended claims, the invention may be practiced otherwise than as specifically described.

Abstract

The disclosed invention relates to a method for use in managing of a plurality of resource devices, supported by a peer-to-peer (P2P) network which enables transferring of files in a non-sharing environment. The main steps include transferring job execution input from a submission host to an execution host, job execution and finally transferring the job output back to the submission host in a file non-sharing manner.

Description

METHOD FOR MANAGING COMPUTATIONAL RESOURCES OVER A
NETWORK
Field of the Invention
The present invention relates generally to resource management, and more particularly to method for job requests execution in peer-to-peer (P2P) for resource management architecture devoid of file sharing environment.
Background of the Invention
One of the many significant tasks of in relation to resource management involving a plurality of computing resources is to provide effectual scheduling of predefined tasks among these computing resources over a network. It is principally configured to perform job scheduling for resources on a larger scale, or as mentioned, between multiple computing resources. This particular task therefore entails additional vital tasks such as monitoring the plurality of computer resources and serves as the primary entry point for any jobs or tasks submission.
Effectively, a resource management system comprises of at least one resource management server and a plurality of resource agent components or devices. The resource agent devices are suitably configured to receive the jobs or tasks scheduled by the resource management server and subsequently execute the assigned tasks.
In order to allow carrying out the aforementioned responsibilities, the ability of file sharing is therefore preferred within the system purely to eliminate the need of transferring files among the plurality of resources agents or devices, thereby providing time-effective task executing environment.
Peer-to-peer (P2P) technology, an approach that allows diverse connectivity between devices within a network is also profoundly known for use in effective file sharing architecture, whereby an exemplary of the system supported by peer-to-peer (P2P) technology is suitably shown in FIG 1 being the prior art. Primarily, in relation to resource management, it allows scheduling and thereby enabling the resource management server to execute tasks or jobs from another resource management server. While the existing peer-to- peer (P2P) technology provides scalable support for the file sharing ability within the resource management system, it would not operate appropriately or abruptly halted in the event that the shared file environment is discontinued or disrupted , thereby resulting to failure of the overall resource managing system. This is considered as one of the major setbacks that should be effectively prevailed when considering the file sharing system for resource managing.
Recognizing the rather prominent setback as mentioned above, the present invention has been accordingly developed to eliminate said setback and enhance the resource managing system deploying the peer-to-peer (P2P) technology.
Thus, it is the primary object of the present invention to provide a method for use in resource management of a plurality of computing resources, supported by peer-to-peer (P2P) technology within a network devoid of file sharing. It is a further object of the present invention to provide a method for use in resource management in which there is provided a simplistic architecture including to automatically gather job execution information from respective hosts and allowing transferring of information between hosts devoid of the file sharing environment.
It is another object of the present invention to provide a method for use in resource management of a plurality of computing resources, supported by peer-to-peer (P2P) technology which is capable to replace the existing peer-to-peer (P2P) with file sharing environment in relation resource management.
These and other objects, features and advantages of the present invention will be apparent from the following detailed description of preferred embodiments thereof.
Brief Description of the Drawings
This invention will be described by way of non-limiting embodiments of the present invention, with reference to the accompanying drawings, in which:
FIG 1 provides a prior art system; and
FIG 2 provides the overall flowchart of the method in accordance with a preferred embodiment of the present invention. Summary of Invention
The present invention discloses a method for use in managing computational resources within a network comprising the steps of:
gathering information based on job execution request from several hosts, wherein at least one host is configured for submission host, at least one host is configured for execution host and at least one host is configured for execution directory; creating a job execution directory based on the job execution request; transferring information in relation to the job execution based on said job execution directory from the submission host to the execution host; executing the job; storing the output of the executed job at the job execution directory; transferring the stored job execution directory of the executed job from the execution host to the submission host; and deleting the job execution directory and all information related to said directory.
Detailed Description of the Preferred Embodiments
In line with the above summary, the following description of a number of specific and alternative embodiments is provided to understand the inventive features of the present invention. It shall be apparent to one skilled in the art, however that this invention may be practiced without such specific details.
The present invention focuses on providing an automated stage-in/stage-out file method for use in resource managing, which is a step ahead the prior art, such that the method effectively eliminates the need of file sharing environment in a peer-to-peer (P2P) network.
Peer-to-peer (P2P) connectivity is preferred for operating the tasks based on the method of the present invention due to the advantages such as fast retrieval of data within the interconnected devices upon prompted and aids to reduce inaccuracies in relation to outdated data.
There is provided a method supported by the peer-to-peer (P2P) network devoid of shared file system, configured based on the automated stage-in/stage out directives, whereby the system configured with the directives may include devices to perform the main tasks such as storage, scheduling and execution of jobs, respectively. Devices involve may be configured to be connected based on diverse connectivity between the devices and not dependant on a centralized server. Accordingly, any one of the devices within the network may initiate connection or communication if required.
FIG 2 provides an overall architecture of the automated file stage-in/stage-out flow configured in accordance with a preferred embodiment of the present invention.
Upon receipt of job execution information or request from remote client sites, the job execution information is gathered (SlOO) from at least three different hosts, these hosts may be in the form of servers, whereby at least one is configured for data submission host, at least one configured for execution host and at least one configured for data execution directory. It is apparent to a person skilled in the art that jobs used within the description include various forms applications, assignments, queues and the likes. Nevertheless, it should be mentioned here that there may be provided only one server for storing all data, and sectionalized into these three categories. The main objective is to provide a centralized unit for storage of data in relation to these categories which may be retrieved or transferred from one host to another when required devoid of the file sharing environment, with the assistance of the peer-to-peer (P2P) technology. In addition, job data and information related may be updated automatically and maintained within the servers.
Ideally, the submission host primary purpose is to allow submission of jobs and information related thereto and thereby stores all job submissions whereby stored job submissions may be transferred to other hosts if prompted. Other significant roles which may be performed by this particular include scheduling jobs, reorder and reprioritize jobs. It is therefore understood that the job submission host may contain all data and input pertaining to job submissions for onward transmission or dispatched to other hosts when necessary. The second server, which is configured for execution host may contain all data and input pertaining to job executions in addition to its main function as the job execution domain for all submitted jobs. It is also noted that the data and information from this host may be transferred to another host upon prompted. The third server is configured to contain all data and input pertaining to executed jobs and applications, and therefore provided in the form of job execution directory. It is understood that all information contained within all three servers may be configured to be retrievable, updated or modified if required. The information gathered based on these servers are used as reference or basis for the file staging purposes, job execution and job monitoring.
From the above, upon prompted, the job execution directory is created (S200) for a respective job submission. The creation of directory for the job execution request is rather essential for the method of the present invention. Each directory created is unique or specific based on the job execution request and therefore prevents mixed up of information for execution of jobs. Subsequently, upon creation of the job execution directory, all job input and information files related to the directory are transferred (S300) from the submission host to the execution host for proper execution and this step do not require file sharing environment, with the established connectivity provided by the peer-to-peer (P2P) network. From here, the selected job is suitably executed (S400) based on the input files within the job execution directory. The job output are then forwarded and thereby stored based on the created job execution directory. Upon completion of execution of the respective job, the job execution directory for that particular job together with its content are appropriately archived (S500) and transferred back (S600) from the execution host to the submission host prior to deletion (S700) of the directory and its content, as the final stage which thereby sustaining a non-sharing environment.
It is further added that the steps involved in the method in accordance with a preferred embodiment of the present invention are configured to operate automatically, or self- organized based on the job execution information gathered, upon received from client sites. It is also understood that anyone of the steps may be repeated in no particular order. With the method of the present invention which does not necessitate file sharing, the amount of file pollution or poisoning which normally exist in many peer-to-peer (P2P) file sharing systems may be effectively reduced.
From the foregoing, it would be appreciated that the present invention provides a method for providing effective and highly efficient resource management within a peer-to- peer (P2P) network. The present invention may be modified in light of the above teachings. It is therefore understood that, within the scope of the appended claims, the invention may be practiced otherwise than as specifically described.

Claims

1. A method for use in managing computational resources within a network comprising the steps of: gathering information (SlOO) based on job execution request from a plurality of hosts, wherein at least one host is configured for submission host, at least one host is configured for execution host and at least one host is configured for execution directory; creating a job execution directory based on the job execution request (S200); transferring information (S300) in relation to the job execution based on said job execution directory from the submission host to the execution host; executing the job (S400); storing the output of the executed job in the job execution directory (S500); transferring the stored job execution directory (S600) of the executed job from the execution host to the submission host; and deleting the job execution directory (S700) and all information related to said directory.
2. A method as claimed in Claim 1 wherein the method is supported by a peer-to-peer (P2P) network.
3. A method as claimed in Claim 1 wherein the storing of output of the executed job at the job execution directory includes archiving the output of the executed job based on the created job executed directory.
4. A method as claimed in Claim 1 wherein the method further includes receiving the job execution request from a remote client device.
5. A method as claimed in Claim 1 wherein the method further includes storing all information based on job execution request within hosts.
6. A method as claimed in Claim 1 wherein the transferring of information between hosts is performed in a non-sharing environment.
7. A method as claimed in Claim 1 wherein the information gathered from the hosts relates to information to be used as a basis for the job execution.
PCT/MY2009/000216 2008-12-26 2009-12-24 Method for managing computational resources over a network WO2010074554A2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP09835317A EP2370904A4 (en) 2008-12-26 2009-12-24 Method for managing computational resources over a network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
MYPI20085329 2008-12-26
MYPI20085329 2008-12-26

Publications (2)

Publication Number Publication Date
WO2010074554A2 true WO2010074554A2 (en) 2010-07-01
WO2010074554A3 WO2010074554A3 (en) 2010-11-25

Family

ID=42288333

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/MY2009/000216 WO2010074554A2 (en) 2008-12-26 2009-12-24 Method for managing computational resources over a network

Country Status (2)

Country Link
EP (1) EP2370904A4 (en)
WO (1) WO2010074554A2 (en)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040019514A1 (en) * 2002-07-23 2004-01-29 Sun Microsystems, Inc., A Delaware Corporation Submitting and monitoring jobs in peer-to-peer distributed computing
US20040019890A1 (en) * 2002-07-23 2004-01-29 Sun Microsystems, Inc., A Delaware Corporation Distributing and executing tasks in peer-to-peer distributed computing
US7533141B2 (en) * 2003-01-24 2009-05-12 Sun Microsystems, Inc. System and method for unique naming of resources in networked environments
US20060048157A1 (en) * 2004-05-18 2006-03-02 International Business Machines Corporation Dynamic grid job distribution from any resource within a grid environment
JP4308241B2 (en) * 2006-11-10 2009-08-05 インターナショナル・ビジネス・マシーンズ・コーポレーション Job execution method, job execution system, and job execution program

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of EP2370904A4 *

Also Published As

Publication number Publication date
EP2370904A4 (en) 2012-07-04
EP2370904A2 (en) 2011-10-05
WO2010074554A3 (en) 2010-11-25

Similar Documents

Publication Publication Date Title
JP5624655B2 (en) Message to transfer backup manager in distributed server system
US8615588B2 (en) Accelerate copying of virtual machine images
KR101970054B1 (en) Method and apparatus for scheduling the cloud servers
JP4856966B2 (en) Backup system, file server, and backup method
CN100484119C (en) Method, system and device for creating service instance in computational grid
US8671134B2 (en) Method and system for data distribution in high performance computing cluster
CN100487689C (en) Holder selector used in global network service structure and its selection method
CN101689169B (en) Management of external hardware appliances in a distributed operating system
US9652294B2 (en) Cross-platform workload processing
US7885906B2 (en) Problem solving system and method
JP2010537317A (en) Workflow engine system and method
JP6342110B2 (en) Multi-tenant service system, information processing apparatus, control method, and program
JP2009230581A (en) Batch job control system, management node, and batch job control method
JP5294014B2 (en) File sharing method, computer system, and job scheduler
JP5086820B2 (en) Service management method, system and program
JP2009031898A (en) Information saving system, server, server program, client, and client program
WO2010074554A2 (en) Method for managing computational resources over a network
GB2462523A (en) Workflow automation and request processing
JP6169485B2 (en) Distributed processing system
JP6292892B2 (en) Information processing apparatus, information processing method, and program
JP6147299B2 (en) Relay server system and communication method using relay server
US9047157B1 (en) Method and apparatus for using unspecialized software micro-containers for building complex dynamic business processes
JP5392367B2 (en) Management device
KR101055385B1 (en) Engineering framework system for integrating and executing grid-based distributed engineering and computing resources and engineering processing method using the same
JP2003203061A (en) Parallel computer system, and program for selecting calculation node in parallel computer system

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09835317

Country of ref document: EP

Kind code of ref document: A2

WWE Wipo information: entry into national phase

Ref document number: 2009835317

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 4417/DELNP/2011

Country of ref document: IN

NENP Non-entry into the national phase in:

Ref country code: DE