WO2002031654A1 - Utilisation repartie d'ordinateurs heterogenes en reseau avec facturation - Google Patents

Utilisation repartie d'ordinateurs heterogenes en reseau avec facturation Download PDF

Info

Publication number
WO2002031654A1
WO2002031654A1 PCT/DE2000/003553 DE0003553W WO0231654A1 WO 2002031654 A1 WO2002031654 A1 WO 2002031654A1 DE 0003553 W DE0003553 W DE 0003553W WO 0231654 A1 WO0231654 A1 WO 0231654A1
Authority
WO
WIPO (PCT)
Prior art keywords
mediator
order
provider
worker
orders
Prior art date
Application number
PCT/DE2000/003553
Other languages
German (de)
English (en)
Inventor
Rainer Glaschick
Gerhard Schulz
Wolfgang Thronicke
Original Assignee
Siemens Aktiengesellschaft
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 Siemens Aktiengesellschaft filed Critical Siemens Aktiengesellschaft
Priority to PCT/DE2000/003553 priority Critical patent/WO2002031654A1/fr
Publication of WO2002031654A1 publication Critical patent/WO2002031654A1/fr

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/5061—Partitioning or combining of resources
    • G06F9/5072—Grid computing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/50—Indexing scheme relating to G06F9/50
    • G06F2209/5017—Task decomposition

Definitions

  • the invention relates to the use of networked heterogeneous computers, wherein the service called up by the computers is remunerated. It relates in particular to techniques in which otherwise unused computing power is used.
  • the processing time for a subtask can easily be a week, so that relatively rare access to the control center is necessary via the network.
  • ('tenderer') Provides orders ('Jobs') for processing and receives the results
  • a first measure is to introduce an agent ('conveyor'). This accepts the orders from the providers and lines them up in an order Queue on. At the same time, the workers ask the agent for orders.
  • the essential function of the intermediary is to anonymize providers and workers against each other and to bill the services.
  • Hayes has already proposed a 'clearinghouse'; however, it appears from the context that its primary task is to set prices according to supply and demand. However, Hayes lacks the knowledge that in the case of tasks that can be broken down into a large number of relatively independent orders, knowledge of a single or a small, randomly selected number of orders only allows the worker to use the entire task with great computing power close and get a significant amount of information.
  • each job is sent to two different workers.
  • the results have to be identical, and second, both workers are to be paid equally. It turns out that this deliberate "waste" of computing power ensures that manipulations are not worthwhile for the worker. After all, in this way the unused computing power of the Internet becomes commercially available and a large number of participants are tapped who have so far been of no interest due to the lack of incentive.
  • the agent does not even have to save the data of the orders in his queue.
  • the provider only transmits a URL with which an order can be called up from its server.
  • This can also be a URL for dynamic data delivery, as can be reached with a CGI script.
  • This information is put in the queue.
  • a worker who wants to process such an order in turn receives a URL, but this is different from that of the provider. With this URL, the worker turns to the agent in the The way a 'proxy server' works. The latter then fetches the data from the provider and passes it on to the worker.
  • Filters are programs that read exactly one input file sequentially and write exactly one output file sequentially.
  • P-code stands for a virtual machine language designed for the PASCAL programming language, which was used by the first PASCAL compilers.
  • a P-code interpreter for the original definition of PASCAL is designed for a filter function, so it cannot carry out any further system accesses.
  • the input file then contains the P code of the program to be executed, certainly in a packed form, and then the input data.
  • the interpreted program reads input line by input line and generates the corresponding output.
  • the program will temporarily store entries in arrays if a reset to the beginning is not intended.
  • a P-code interpreter is quite small in the source code and can therefore also be made available in the source code without any problems, so that it can be checked against security gaps during installation, if not the component that realizes the worker, is adopted by the intermediary as a binary file.
  • the worker first retrieves the entire input file and stores it temporarily on his own disk, then executes the job, also temporarily stores the output and then sends the output back "en bloc". This is special advantageous if the network connection is only temporary.
  • one input and one output connection to the provider usually via the intermediary, can be set up when the order is processed.
  • Input lines are then buffered as long as there is space for them, and further requests are made via the connection after they have been used up. Accordingly, the output is buffered, but is regularly delivered via the output connection. This behavior is particularly useful when a large amount of data has to be processed.
  • PASCAL the use of JAVA, for which a virtual command set is also defined, is called JAVA bytecode here.
  • JAVA on-the-fly compilers are also known that convert the bytecode into machine code during execution and thus achieve very high efficiency.
  • the security concept from JAVA also called 'sandbox', also allows no privileges to be granted to the JAVA program, so that spying on the workers' computer is prevented.
  • One of the simplest workers therefore consists of a constantly or time-controlled or event-controlled program, e.g. a screen saver that fetches a URL from the intermediary, then fetches and formats the HTML file designated with it.
  • the HTML file receives JAVA or JAVAscript 'applets', which are then executed.
  • the results of the program or scripts are then sent to the provider as an HTML form using the intermediary's proxy function.
  • solutions can also be provided in which a partially processed job is queued again and processed by the next worker.
  • 'agents' There are two variants here: firstly, fixed applications in which the data format is selected so that an intermediate status is always saved.
  • the diagonalization of a matrix can be used as an example, the processing of which consists of a chain of matrices that come closer and closer to the result and finally reaches it.
  • Another variant, also referred to as 'snapshot' stores the values of the program variables together with the program and can therefore resume execution.
  • this version requires quite a bit of memory to store the intermediate state.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Transfer Between Computers (AREA)
  • Computer And Data Communications (AREA)

Abstract

Procédé d'utilisation de capacités informatiques libres selon lequel un agent transmet des mandats et fait traiter ces derniers plusieurs fois à des fins de sécurité.
PCT/DE2000/003553 2000-10-10 2000-10-10 Utilisation repartie d'ordinateurs heterogenes en reseau avec facturation WO2002031654A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/DE2000/003553 WO2002031654A1 (fr) 2000-10-10 2000-10-10 Utilisation repartie d'ordinateurs heterogenes en reseau avec facturation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/DE2000/003553 WO2002031654A1 (fr) 2000-10-10 2000-10-10 Utilisation repartie d'ordinateurs heterogenes en reseau avec facturation

Publications (1)

Publication Number Publication Date
WO2002031654A1 true WO2002031654A1 (fr) 2002-04-18

Family

ID=5647974

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE2000/003553 WO2002031654A1 (fr) 2000-10-10 2000-10-10 Utilisation repartie d'ordinateurs heterogenes en reseau avec facturation

Country Status (1)

Country Link
WO (1) WO2002031654A1 (fr)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5892945A (en) * 1996-03-21 1999-04-06 Oracle Corporation Method and apparatus for distributing work granules among processes based on the location of data accessed in the work granules
US6112225A (en) * 1998-03-30 2000-08-29 International Business Machines Corporation Task distribution processing system and the method for subscribing computers to perform computing tasks during idle time

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5892945A (en) * 1996-03-21 1999-04-06 Oracle Corporation Method and apparatus for distributing work granules among processes based on the location of data accessed in the work granules
US6112225A (en) * 1998-03-30 2000-08-29 International Business Machines Corporation Task distribution processing system and the method for subscribing computers to perform computing tasks during idle time

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
NISAN N ET AL: "Globally distributed computation over the Internet-the POPCORN project", PROCEEDINGS. 18TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (CAT. NO.98CB36183), PROCEEDINGS OF 18TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, AMSTERDAM, NETHERLANDS, 26-29 MAY 1998, 1998, Los Alamitos, CA, USA, IEEE Comput. Soc, USA, pages 592 - 601, XP002174140, ISBN: 0-8186-8292-2 *
O. REGEV: "Economic orienter CPU sharing system for the Internet", THESIS, July 1998 (1998-07-01), Institute of Computer Science, Jerusalem, Israel, pages 1 - 56, XP002174142 *
TAKAGI H ET AL: "Ninflet: a migratable parallel objects framework using Java", WORKSHOP ON JAVA FOR HIGH-PERFORMANCE NETWORK COMPUTING, 1998, pages 151 - 159, XP002174141 *

Similar Documents

Publication Publication Date Title
DE69724877T2 (de) Verfahren und Vorrichtung zum Betrieb einer Aggregation von Serverrechnern mittels eines Doppelzweck-Proxy-Servers
DE112012000797B4 (de) Mehrfach-Modellierungsparadigma für eine Vorhersageanalytik
DE69533148T2 (de) Verfahren und Gerät zur Erzeugung und Verwendung kurzer Operationsidentifizierer in objektorientierten Systemen
DE69926459T2 (de) Verfahren und vorrichtung zur umlenkung von serverexternen hyperlink-referenzen
DE69734432T2 (de) Verfahren und Vorrichtung zur Absendung von Clientverfahrenanrufen in einem Server Rechnersystem
EP1108308A1 (fr) Systeme et procede permettant de controler le deroulement d'une session dans les applications en reseau
EP1097428A2 (fr) Systeme et procede de verification d'utilisations d'un reseau
DE10039538A1 (de) Vorrichtung und Methode zum Analysieren der Leistung eines Computerprogramms
DE112005001995B4 (de) Computeranordnung und Verfahren zum Anbieten von Diensten für Benutzer über ein Netzwerk
DE69814697T2 (de) Vorrichtung, methode und computer programm produkt für client/server rechner mit vom client auswählbarer lokalisierung von transaktionsobjekten
EP2648094B1 (fr) Procédé et système de production d'un code source pour un programme informatique pour l'exécution et la simulation d'un processus
DE10222361C2 (de) Verfahren zum Betreiben eines verteilten Rechnernetzwerks umfassend mehrere verteilt angeordnete Rechner
DE10135136A1 (de) Sichere Datenberichtausbildung und -zustellung
DE19626972A1 (de) Verfahren und Vorrichtung zur vorläufigen Freigabe für die Anwendung eines von einer elektronischen Kassette geschützten Programms
EP3576001A1 (fr) Procédé mis en uvre par ordinateur permettant de transférer une chaîne de données à partir d'une application vers un dispositif de protection des données à caractère personnel
DE19933584A1 (de) Verfahren zur kompakten Darstellung von Informationspaketen und deren Speicherung oder Übertragung
DE102013211266A1 (de) Aufrechterhalten der Bandbreiten-Servicequalität einer Hardware-Ressource über einen Hardware-Zähler
WO2002031654A1 (fr) Utilisation repartie d'ordinateurs heterogenes en reseau avec facturation
EP3557341A1 (fr) Procédé et dispositif de gestion permettant d'optimiser un processus industriel
DE19933299A1 (de) Verteilte Nutzung heterogener vernetzter Rechner mit Abrechnung
WO2010034548A1 (fr) Module de test et procédé destiné à tester un intergiciel de mapping o/r
DE102019214255A1 (de) Dynamisches Zuweisen von Sonderaufgaben in verteilten Netzwerken
WO2004081971A2 (fr) Procede d'exploitation d'un microprocesseur et systeme de microprocesseur
EP3163444B1 (fr) Reseau informatique faisant appel a la sollicitation et l'affectation automatiques de ressources infonuagiques
EP3746895B1 (fr) Procédé destiné à produire des protocoles de processus dans une infrastructure de ti répartie

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase