US20130104135A1 - Data center operation - Google Patents

Data center operation Download PDF

Info

Publication number
US20130104135A1
US20130104135A1 US13/643,595 US201113643595A US2013104135A1 US 20130104135 A1 US20130104135 A1 US 20130104135A1 US 201113643595 A US201113643595 A US 201113643595A US 2013104135 A1 US2013104135 A1 US 2013104135A1
Authority
US
United States
Prior art keywords
map
task
outputs
tracker
reduce
Prior art date
Legal status (The legal status 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 status listed.)
Granted
Application number
US13/643,595
Other versions
US9378053B2 (en
Inventor
Bin Cai
Zhe Xiang
Wei Xu
Bo Yang
Qi Yu
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
New Orchard Road
Original Assignee
New Orchard Road
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 New Orchard Road filed Critical New Orchard Road
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: XIANG, ZHE, CAI, BIN, XUE, WEI, YANG, BO, YU, QI
Publication of US20130104135A1 publication Critical patent/US20130104135A1/en
Application granted granted Critical
Publication of US9378053B2 publication Critical patent/US9378053B2/en
Expired - Fee Related legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/52Program synchronisation; Mutual exclusion, e.g. by means of semaphores
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/70Software maintenance or management
    • G06F8/71Version control; Configuration management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • G06F9/5066Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/18File system types
    • G06F16/182Distributed file systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/18File system types
    • G06F16/1873Versioning file systems, temporal file systems, e.g. file system supporting different historic versions of files
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/40Data acquisition and logging
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4812Task transfer initiation or dispatching by interrupt, e.g. masked

Definitions

  • the present invention relates to a mechanism used in a data center, and particularly, to a method and system with version management.
  • MapReduce mechanism is a software framework for distributed computing proposed by Google, which can implement parallel computing on large scale data sets.
  • the concepts and main ideas of “Map” and “Reduce” are originated from functional programming languages.
  • Current MapReduce middleware implementations require an application developer to specify a map function to map a set of key-value pairs to some new key-value pairs (referred to as intermediate key-value pairs), and also require the application developer to specify a reduce function to further process the intermediate key-value pairs outputted from the map function.
  • input data are partitioned into M input data splits automatically, and then these input data splits are distributed to multiple machines for parallel processing.
  • the intermediate key-value pairs are partitioned into R splits (e.g., hash (key) mod R) based on intermediate key names by a partition function, and the R splits are also distributed to multiple machines.
  • R splits e.g., hash (key) mod R
  • the number of partition R and the partition function may be specified by users.
  • the MapReduce mechanism can achieves scalability by distributing operations on the large scale data sets to multiple nodes in a network.
  • MapReduce mechanism is considered as an important program design specification for building a data center, and has a very wide range of applications.
  • the typical applications include: distributed grep, distributed sorting, web access log analysis, reverse index building, document clustering, machine learning, statistics-based machine translation, and so on.
  • FIG. 1 shows a schematic diagram of an existing MapReduce architecture, wherein a job tracker and multiple task trackers are two most basic services in the MapReduce architecture.
  • the job tracker is deployed on a master node, receives jobs submitted by users, schedules all the jobs, manages all the task trackers, divides each of the jobs submitted by the users into multiple tasks including map tasks and reduce tasks, and is responsible for distributing the tasks to the corresponding task trackers.
  • a task as a basic element to be performed, is distributed to an appropriate task tracker for execution.
  • the multiple task trackers poll the job tracker to acquire the tasks.
  • a task tracker executing a map task is a map task tracker
  • a task tracker executing a reduce task is a reduce task tracker.
  • the task tracker reports the states of the tasks to the job tracker while executing the tasks, thereby helping the job tracker to know the whole job execution.
  • an input file is uploaded to a distributed file system deployed on the data center, and is partitioned into M input data splits according to a partition rule.
  • the size of each split is generally from 16 to 64 MB.
  • the program files required for job execution are also uploaded to the distributed file system, including job configuration files (including a map function, a combine function, a reduce function, etc.) and the like.
  • job tracker When receiving a job request from a client program, the job tracker divides the job into multiple tasks, which include M map tasks and R reduce tasks, and is responsible for distributing the map tasks or reduce tasks to the idle task trackers.
  • the map task trackers read the corresponding input data splits based on the distributed tasks, and analyze them to obtain input key-value pairs. Then, the map task trackers invoke the map function (e.g. map( )) to map the input key-value pairs into the intermediate key-value pairs, and the intermediate key-value pairs generated by the map function are buffered in a memory. For the buffered key-value pairs, the combine function is invoked to aggregate all key values for each key name and the partition function is invoked to partition the buffered key-value pairs into R splits, then the R splits are written into R regions of local disk periodically. After the map tasks are completed, the map task trackers inform the job tracker of task completion and of position information of the intermediate key-value pairs on its local disk.
  • map function e.g. map( )
  • the reduce task trackers When the reduce task trackers receive the reduce tasks from the job tracker, they read the intermediate key-value pairs from the local disk of one or more map task trackers based on the position information, then sort the intermediate key-value pairs based on the key name, and aggregate the key values of the same key name.
  • the reduce task trackers invoke the reduce function (e.g. reduce ( )) to reduce these intermediate key-value pairs, and add the outputs of the reduce function into a final output file.
  • reduce function e.g. reduce ( )
  • the involved overhead e.g., data calculation overhead, data transfer overhead, etc.
  • the sizes of the input data sets usually increase along with the time, for example, a Call Detail Record (CDR) data set in the telecommunication field and web logs data set in network sites are growing day by day.
  • CDR Call Detail Record
  • the sizes of the accumulated data sets could reach a very large scale soon and continue to increase day by day, which makes the MapReduce jobs over them require more time or resources.
  • the present invention is proposed in view of the above technical problem, and its objective is to provide a method and system for operating a data center, which can effectively reduce the amount of data to be processed each time when data addition occurs, thereby reducing the processing time.
  • a method for operating a data center comprising: in response to a map task distributed by the job tracker, the map task tracker executing the map task to generate a map output including version information; the map task tracker storing the generated map output; the map task tracker informing the job tracker of related information of the map output; in response to a reduce task distributed by the job tracker, the reduce task tracker acquiring map outputs for key names including given version information from the map task trackers, wherein the acquired map outputs include the map outputs including the given version information and historical map outputs including the version information prior to the given version information; and the reduce task tracker executing the reduce task on the acquired map outputs.
  • a method for reducing data by a reduce task tracker in a data center comprises: in response to a reduce task distributed by a job tracker, acquiring map outputs for key names including given version information from map task trackers, wherein the acquired map outputs include the map outputs including the given version information and historical map outputs including the version information prior to the given version information; and executing the reduce task on the acquired map outputs.
  • a MapReduce system for a data center which comprises: a job tracker that specifies a map task tracker to execute a map task and a reduce task tracker to execute a reduce task; a map task tracker, which comprises: a map task execution module that, in response to a map task distributed by the job tracker, executes the map task to generate a map output including version information; a storage module that stores the generated map outputs; an informing module that informs the job tracker of related information of the map output; and a provision module that, in response to a request from a reduce task tracker, provides the requested map outputs to the reduce task tracker; and a reduce task tracker, which comprises: an acquisition module that, in response to a reduce task distributed by the job tracker, acquires map outputs for key names including given version information from the map task trackers, wherein the acquired map outputs include the map outputs including the given version information and historical map outputs including the version information prior to the given version information
  • FIG. 1 is a schematic diagram of an existing MapReduce architecture
  • FIG. 2 is a flow chart of a MapReduce method for a data center according to an embodiment of the present invention
  • FIG. 3 is a flow chart of an example of the map task tracker executing the map task in the embodiment shown in FIG. 2 ;
  • FIG. 4 is a flow chart of another example of the map task tracker executing the map task in the embodiment shown in FIG. 2 ;
  • FIG. 5 is a flow chart of an example of the reduce task tracker acquiring map outputs from the map task tracker in response to the reduce task distributed by the job tracker in the embodiment shown in FIG. 2 ;
  • FIG. 6 is a flow chart of another example of the reduce task tracker acquiring map outputs from the map task tracker in response to the reduce task distributed by the job tracker in the embodiment shown in FIG. 2 ;
  • FIG. 7 is a flow chart of a method for reducing data by a reduce task tracker in a data center according to an embodiment of the present invention
  • FIG. 8 is a schematic block diagram of a MapReduce system for a data center according to an embodiment of the present invention.
  • FIG. 9 is a schematic block diagram of a map task tracker according to an embodiment of the present invention.
  • FIG. 10 is a schematic block diagram of a reduce task tracker according to an embodiment of the present invention.
  • FIG. 2 shows a flow chart of a MapReduce method for a data center according to an embodiment of the present invention. The present embodiment will be described in detail in conjunction with the figure.
  • the data center includes a job tracker, map task trackers and reduce task trackers.
  • the map task tracker executes the map task to generate the map outputs including version information.
  • the job tracker receives a job request from a client program, divides the job into multiple tasks including M map tasks and R reduce tasks, and distributes the map tasks or reduce tasks to the idle task trackers.
  • the map task tracker starts to execute the map task.
  • the version information only includes a version value (i.e. the version information is the version value) will be primarily described.
  • FIG. 3 shows a flow chart of an example of the map task tracker executing the map task.
  • the map task tracker receives the map task from the job tracker, wherein the map task includes storage positions for input data splits of the map task.
  • the input data splits are read from the storage positions.
  • the storage positions may be the map task tracker or other servers.
  • the map task tracker analyzes the read input data splits to generate a set of key-value pairs in the form of ⁇ key name (Key), key value (Value)>.
  • the map task tracker assigns a version value Version to each of the key-value pair.
  • the form of the key-value pair becomes ⁇ Key, Value, Version>.
  • the map task tracker employs a map function to execute a map operation on the key-value pairs including the version value.
  • the key-value pairs including the version value are delivered to the map function specified by the user, and the map function executes mapping on the key names and key values without changing the version value, thereby forming the intermediate key-value pairs including the version value.
  • the generated intermediate key-value pairs including the version value are buffered in a memory.
  • the partition operation is executed on the buffered intermediate key-value pairs. Specifically, the combine function and the partition function are applied to the buffered intermediate key-value pairs to generate the map output of the map task, wherein the key values of the same key name are aggregated together, i.e., the map output is represented as ⁇ Key, Value 1, Version, Value2, Version, . . . >.
  • FIG. 4 shows a flow chart of another example of the map task tracker executing the map task, wherein the steps S 401 , S 402 , S 403 are identical with the steps S 301 , S 302 , S 303 in the example shown in FIG. 3 .
  • the map function is used to execute the map operation on the generated key-value pairs to generate the intermediate key-value pairs.
  • the version value is assigned to each of the above intermediate key-value pairs and the intermediate key-value pairs including the version value are buffered in the memory.
  • the buffered intermediate key-value pairs including the version value are partitioned to generate the map output of the map task.
  • the map task tracker stores the map output generated in step S 201 .
  • the map task tracker stores the map output in the storage region of the local hard disk according to the version value and the associated reduce task tracker (index identifications in the R reduce tasks may be used).
  • the map outputs including the same key name are associated with the same reduce task tracker.
  • the map output can be stored in other ways besides based on the version value and the associated reduce task tracker.
  • the map task tracker informs the job tracker of the related information of the map output.
  • the related information of the map output may include a job number, a map task number and the version information.
  • the related information may include a set of key names, i.e., the set of the key names involved in the map task.
  • the map task tracker informs the job tracker of the task completion, and transmits the related information of the map output to the job tracker, so that the job tracker can provide it to the reduce task tracker.
  • the map task tracker may use Bloom Filter to process these key names to save the storage space.
  • the Bloom Filter is well known to those skilled in the art, and the description thereof will be omitted herein.
  • the reduce task tracker acquires map outputs for key names including a given version value from map task trackers, wherein the acquired map outputs include the map outputs including the given version value and the historical map outputs including the version values prior to the given version value.
  • the communication between the reduce task tracker and the map task tracker is based on a pull model. In this step, after the job tracker knows that all map tasks are completed, it informs the reduce task tracker to begin to execute the reduce task.
  • FIG. 5 shows a flow chart of an example of the reduce task tracker acquiring map outputs from the map task trackers in response to the reduce task distributed by the job tracker.
  • the example is suitable for the case where the related information includes the job number, the map task number and the version value.
  • the reduce task tracker receives the reduce task from the job tracker, wherein the reduce task includes the given version value.
  • the given version value can be used to define a range of the map outputs required for the reduce task.
  • the reduce task tracker requests the map outputs from all map task trackers, wherein the request includes the given version value.
  • the map task trackers After receiving the above request for the map outputs, at step S 503 , the map task trackers find the map outputs from the associated local storage regions based on the given version value and an identity of the reduce task tracker. Then, at step S 504 , the map task trackers transmits the found map outputs to the reduce task tracker. After receiving the transmitted map outputs including the given version value, at step S 505 , the reduce task tracker extracts the key names from the received map outputs, these key names being the key names to be processed by the reduce tasks to be executed. Then, at step S 506 , based on the extracted key names, the reduce task tracker requests the historical map outputs for these key names including the version values prior to the given version value from all map task trackers.
  • the map task trackers After receiving the request for the historical map outputs for the key names, at step S 507 , the map task trackers find the historical map outputs for these key names, and at step S 508 , the map task trackers transmit the found historical map outputs to the reduce task tracker.
  • the reduce task tracker receives these historical map outputs and alternatively combines the historical map outputs with the previously received map outputs including the given version value based on the key names. In the example shown in FIG. 5 , the reduce task tracker acquires the desired map outputs through two pull operations.
  • FIG. 6 shows a flow chart of another example of the reduce task tracker acquiring map outputs from the map task trackers.
  • the example is suitable for the case where the related information includes the job number, the map task number, the version value and a set of key names.
  • the reduce task tracker receives the reduce task from the job tracker, wherein the reduce task includes the given version value and a set of given key names.
  • the set of given key names indicates the key names to be processed by the distributed reduce task.
  • the reduce task tracker sends a request to all map task trackers for map outputs, wherein the request includes the given version value and the set of given key names.
  • the map task trackers After receiving the above request for the map outputs, at step S 603 , the map task trackers find the map outputs for all the key names in the given key name set, wherein the map outputs for each of the key names include the map outputs for the key name including the given version value and the historical map outputs for the key name including the version values prior to the given version value.
  • the map task trackers transmit the found map outputs to the reduce task tracker.
  • the reduce task tracker receives the map outputs from the map task trackers. In the example shown in FIG. 6 , when the job tracker specifies the set of key names required for the reduce task, the reduce task tracker may obtain the desired map outputs through only one pull operation.
  • the map task tracker uses the Bloom Filter to process the set of key names when informing the job tracker of the related information, after receiving the request, the map task tracker also uses the Bloom Filter to determine whether it stores the map outputs for the key names in the set of key names.
  • the reduce task tracker executes the reduce task on the acquired map outputs.
  • the reduce task tracker sorts the acquired map outputs, so that the map outputs for the same key name are aggregated together.
  • the sorted map outputs for each of the key names may include the map outputs for the key name including the given version value and the historical map outputs for the key name including the version values prior to the given version value from different map task trackers.
  • the reduce task tracker uses the reduce function to execute the reduce operation on the sorted map outputs, that is, the sorted map outputs are delivered to the reduce function, and the outputs generated by the reduce function are added into the final output file.
  • the reduce task tracker informs the job tracker of the reduce task completion.
  • the version information (e.g. the version value, etc.) is introduced to identify whether the data addition occurs and the reduce task tracker only acquires the intermediate key-value pairs affected by the data addition from the map task tracker and executes the reduce operation without acquiring other unaffected intermediate key-value pairs, thereby efficiently reducing the number of the key-value pairs to be processed and the required resources when the data addition occurs and further reducing the processing latency.
  • FIG. 7 shows a flow chart of a method for reducing data by the reduce task tracker in the data center according to an embodiment of the present invention.
  • the method of the present embodiment is a part of the MapReduce method performed by the reduce task tracker in the embodiment shown in FIG. 2 , and therefore, the description of the same part thereof is omitted appropriately.
  • the reduce task tracker acquires map outputs for the key names including the given version value from the map task tracker, and the acquired map outputs include the map outputs including the given version value and the historical map outputs including the version values prior to the given version value.
  • the reduce task tracker requests the map outputs from all map task trackers, wherein the request includes the above given version value, then receives the map outputs including the given version value and associated with the reduce task tracker from the map task tracker, and extracts the key names from these map outputs.
  • the extracted key names are the key names to be processed by the reduce tasks to be executed later.
  • the reduce task tracker requests the historical map outputs for the extracted key names including the versions prior to the given version value from all map task trackers, and receives the historical map outputs for these key names from the map task trackers.
  • the reduce task tracker requests the map outputs from all map task trackers, wherein the request includes the above given version value and the set of given key names. Then the reduce task tracker receives the map outputs for all the key names in the set of given key names from the map task tracker, wherein the map outputs for each of the key names include the map outputs for the key name including the given version value and the historical map outputs for the key name including the version values prior to the given version value.
  • the reduce task tracker executes the reduce task on the acquired map outputs. Specifically, the reduce task tracker sorts the acquired map outputs so that the map outputs for the same key name are aggregated together, and then executes the reduce operation on the sorted map outputs with the reduce function.
  • FIG. 8 shows a schematic block diagram of a MapReduce system 800 for a data center according to an embodiment of the present invention.
  • the present embodiment will be described in detail, wherein for the same parts as in the previous embodiments, the description thereof is omitted appropriately.
  • the MapReduce system 800 of the embodiment includes a job tracker 801 , multiple map task trackers 802 and multiple reduce task trackers 803 .
  • the map task tracker 802 further includes: a map task execution module 8021 which, in response to the map task distributed by the job tracker 801 , executes the map task to generate the map output including the version information; a storage module 8022 which stores the map output generated by the map task execution module 8021 ; an informing module 8023 which informs the job tracker 801 of related information of the map output; and a provision module 8024 which, in response to the request from the reduce task tracker 803 , provides the requested map outputs to the reduce task tracker 803 .
  • the reduce task tracker 803 further comprises: an acquisition module 8031 which, in response to reduce task distributed by the job tracker 801 , acquires the map outputs for key names including the given version information from the map task tracker 802 , wherein the acquired map outputs include the map outputs including the given version information and the historical map outputs including the version information prior to the given version information; and a reduce task execution module 8032 which executes the reduce task on the acquired map outputs.
  • MapReduce system 800 of the present embodiment can operatively implement the MapReduce method for a data center as shown in FIG. 2 .
  • FIG. 9 further shows a schematic block diagram of the map task tracker 802 , wherein the version information includes the version value.
  • a task reception unit 901 receives the map task from the job tracker 801 .
  • the storage positions for the input data splits of the map task are indicated in the map task.
  • a data read unit 902 reads the input data splits from the indicated storage positions, and provides them to an analysis unit 903 for analysis to generate the key-value pairs.
  • a version management unit 904 assigns the version value to each of the key-value pairs generated by the analysis unit 903 .
  • the key-value pairs including the version value are transmitted to a mapping unit 905 to execute the map operation with the map function to generate the intermediate key-value pairs.
  • a partition unit 906 executes the partition operation on the generated intermediate key-value pairs to generate the map output of the map task.
  • the version management unit 904 in the map task execution module 8021 assigns the version value to each of the intermediated key-value pairs outputted by the mapping unit 905 after the map operation.
  • the map outputs outputted by the map task execution module 8021 are stored in the storage module 8022 .
  • the storage module 8022 is configured to store the map outputs based on the version value and the associated reduce task tracker 803 .
  • the informing module 8023 informs the job tracker 801 of the map task completion and transmits the related information of the map output to it.
  • the related information may include the job number, the map task number and the version information. Additionally the related information may further include a set of key names.
  • a request reception unit 911 receives the request including the given version value. Then, based on the given version value and the identity of the reduce task tracker 803 which sends the request, a finding unit 912 finds the corresponding map outputs in the associated local regions of the map task tracker 802 , and the found map outputs are transmitted by a transmitting unit 913 to the reduce task tracker 803 . Then the request reception unit 911 receives a request for the historical map outputs for the key names including the version values prior to the given version value from the reduce task tracker 803 . The finding unit 912 finds the historical map outputs for these key names and the transmitting unit 913 transmits these historical map outputs to the reduce task tracker 803 .
  • the request reception unit 911 receives the request for the map outputs, wherein the request includes the given version value and the set of given key names.
  • the finding unit 912 find the map outputs for all the key names in the set of given key names, wherein the map outputs for each of the key names include the map outputs for the key name including the given version value and the historical map outputs for the key name including the version values prior to the given version value, and the transmitting unit 913 transmits these map outputs to the reduce task tracker 803 .
  • FIG. 10 further shows a schematic block diagram of the reduce task tracker 803 .
  • a task reception unit 1001 receives the reduce task from the job tracker 801 . If the received reduce task includes the given version value, a request unit 1002 requests the map outputs from the map task tracker 802 , wherein the request includes the given version value. Then a map output reception unit 1003 receives the map outputs including the given version value.
  • An extraction unit 1004 extracts the key names from these map outputs, and the request unit 1002 requests the historical map outputs for the extracted key names including the version values prior to the given version value from all map task trackers 802 .
  • the map output reception unit 1003 receives the historical map outputs for these key names from the map task trackers 802 . If the received reduce task includes the given version value and the set of given key names, the request unit 1002 requests the map outputs from the map task tracker 802 , wherein the request includes the given version value and the set of given key names. Then the map output reception unit 1003 receives the map outputs for all the key names in the set of given key names from the map task tracker 802 , wherein the map outputs for each of the key names include the map outputs for the key name including the given version name and the historical map outputs for the key name including the version values prior to the given version value.
  • a sorting unit 1011 sorts the map outputs acquired by the acquisition module 8031 so that the map outputs for the same key name are aggregated together, and then a reduce unit 1012 executes the reduce operation on these sorted map outputs with the reduce function.
  • the reduce task tracker 803 of the present embodiment can operatively implement the method for reducing data by a reduce task tracker in a data center as shown in FIG. 7 .
  • the MapReduce method for a data center and the method for reducing data by a reduce task tracker in a data center disclosed in the above embodiments may be implemented in software, hardware, or combination of software and hardware.
  • the hardware portion may be implemented by application specific logic.
  • the MapReduce system and its components as well as the reduce task tracker and its components may be implemented by hardware circuits such as Large Scale Integrated circuits or gate arrays, semiconductors such as logic chips or transistors or programmable hardware devices such as field programmable gate array, programmable logic devices etc., or can be implemented by software which can be executed by various processors, or can be implemented by the combination of the above hardware circuit and software.
  • the software portion can be stored in memory and executed by an appropriate instruction execution system such as microprocessor, personal computer (PC) or mainframe.
  • MapReduce method and system for a data center and the method for reducing data by a reduce task tracker in a data center as well as the reduce task tracker of the present invention have been described in detail through some exemplary embodiments, these embodiments are not exhaustive, and those skilled in the art can realize various changes and modifications within the spirit and scope of the present invention. Therefore, the present invention is not limited to these embodiments, and the scope of which is only defined by appended claims.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Facsimiles In General (AREA)
  • Information Transfer Between Computers (AREA)
  • Multi Processors (AREA)

Abstract

In response to a map task distributed by a job tracker, a map task tracker executes the map task to generate a map output including version information. The map task tracker stores the generated map outputs. The map task tracker informs the job tracker of related information of the map output. In response to a reduce task distributed by the job tracker, the reduce task tracker acquires the map outputs for key names including given version information from the map task trackers, wherein the acquired map outputs include the map outputs with the given version information and historical map outputs with the version information prior to the given version information. The reduce task tracker executes the reduce task on the acquired map outputs.

Description

    TECHNICAL FIELD
  • The present invention relates to a mechanism used in a data center, and particularly, to a method and system with version management.
  • BACKGROUND
  • MapReduce mechanism is a software framework for distributed computing proposed by Google, which can implement parallel computing on large scale data sets. The concepts and main ideas of “Map” and “Reduce” are originated from functional programming languages. Current MapReduce middleware implementations require an application developer to specify a map function to map a set of key-value pairs to some new key-value pairs (referred to as intermediate key-value pairs), and also require the application developer to specify a reduce function to further process the intermediate key-value pairs outputted from the map function. In the map process, input data are partitioned into M input data splits automatically, and then these input data splits are distributed to multiple machines for parallel processing. In the reduce process, the intermediate key-value pairs are partitioned into R splits (e.g., hash (key) mod R) based on intermediate key names by a partition function, and the R splits are also distributed to multiple machines. The number of partition R and the partition function may be specified by users. The MapReduce mechanism can achieves scalability by distributing operations on the large scale data sets to multiple nodes in a network.
  • Currently, the MapReduce mechanism is considered as an important program design specification for building a data center, and has a very wide range of applications. The typical applications include: distributed grep, distributed sorting, web access log analysis, reverse index building, document clustering, machine learning, statistics-based machine translation, and so on.
  • FIG. 1 shows a schematic diagram of an existing MapReduce architecture, wherein a job tracker and multiple task trackers are two most basic services in the MapReduce architecture. Generally, the job tracker is deployed on a master node, receives jobs submitted by users, schedules all the jobs, manages all the task trackers, divides each of the jobs submitted by the users into multiple tasks including map tasks and reduce tasks, and is responsible for distributing the tasks to the corresponding task trackers. A task, as a basic element to be performed, is distributed to an appropriate task tracker for execution. The multiple task trackers poll the job tracker to acquire the tasks. A task tracker executing a map task is a map task tracker, and a task tracker executing a reduce task is a reduce task tracker. The task tracker reports the states of the tasks to the job tracker while executing the tasks, thereby helping the job tracker to know the whole job execution.
  • Specifically, an input file is uploaded to a distributed file system deployed on the data center, and is partitioned into M input data splits according to a partition rule. The size of each split is generally from 16 to 64 MB. The program files required for job execution are also uploaded to the distributed file system, including job configuration files (including a map function, a combine function, a reduce function, etc.) and the like. When receiving a job request from a client program, the job tracker divides the job into multiple tasks, which include M map tasks and R reduce tasks, and is responsible for distributing the map tasks or reduce tasks to the idle task trackers.
  • Next, the map task trackers read the corresponding input data splits based on the distributed tasks, and analyze them to obtain input key-value pairs. Then, the map task trackers invoke the map function (e.g. map( )) to map the input key-value pairs into the intermediate key-value pairs, and the intermediate key-value pairs generated by the map function are buffered in a memory. For the buffered key-value pairs, the combine function is invoked to aggregate all key values for each key name and the partition function is invoked to partition the buffered key-value pairs into R splits, then the R splits are written into R regions of local disk periodically. After the map tasks are completed, the map task trackers inform the job tracker of task completion and of position information of the intermediate key-value pairs on its local disk.
  • When the reduce task trackers receive the reduce tasks from the job tracker, they read the intermediate key-value pairs from the local disk of one or more map task trackers based on the position information, then sort the intermediate key-value pairs based on the key name, and aggregate the key values of the same key name. The reduce task trackers invoke the reduce function (e.g. reduce ( )) to reduce these intermediate key-value pairs, and add the outputs of the reduce function into a final output file.
  • When the existing MapReduce mechanism is used to process the huge data sets, the involved overhead, e.g., data calculation overhead, data transfer overhead, etc., is usually proportional to the sizes of the input data sets. Therefore, when the sizes of the input data sets increase, the above overheads increase too. In addition, the sizes of input data sets usually increase along with the time, for example, a Call Detail Record (CDR) data set in the telecommunication field and web logs data set in network sites are growing day by day. As a result, the sizes of the accumulated data sets could reach a very large scale soon and continue to increase day by day, which makes the MapReduce jobs over them require more time or resources. In the existing MapReduce mechanism, each time when the data addition occurs in the data sets, the whole data sets will be MapReduced again. However, in many cases, although the accumulated data sets are growing larger and larger, the delta addition generated in a day or a week may be much smaller relatively. That is, the affected data are relatively fewer, and thus it may waste many unnecessary time and resources to re-MapReduce the whole data sets, and as the data sets increase, the time and resources required for processing increase too.
  • SUMMARY
  • The present invention is proposed in view of the above technical problem, and its objective is to provide a method and system for operating a data center, which can effectively reduce the amount of data to be processed each time when data addition occurs, thereby reducing the processing time.
  • According to a first aspect of the present invention, a method for operating a data center is provided, wherein the data center includes a job tracker, map task trackers and reduce task trackers, the method comprises: in response to a map task distributed by the job tracker, the map task tracker executing the map task to generate a map output including version information; the map task tracker storing the generated map output; the map task tracker informing the job tracker of related information of the map output; in response to a reduce task distributed by the job tracker, the reduce task tracker acquiring map outputs for key names including given version information from the map task trackers, wherein the acquired map outputs include the map outputs including the given version information and historical map outputs including the version information prior to the given version information; and the reduce task tracker executing the reduce task on the acquired map outputs.
  • According to a second aspect of the invention, a method for reducing data by a reduce task tracker in a data center is provided, which comprises: in response to a reduce task distributed by a job tracker, acquiring map outputs for key names including given version information from map task trackers, wherein the acquired map outputs include the map outputs including the given version information and historical map outputs including the version information prior to the given version information; and executing the reduce task on the acquired map outputs.
  • According to a third aspect of the present invention, a MapReduce system for a data center is provided, which comprises: a job tracker that specifies a map task tracker to execute a map task and a reduce task tracker to execute a reduce task; a map task tracker, which comprises: a map task execution module that, in response to a map task distributed by the job tracker, executes the map task to generate a map output including version information; a storage module that stores the generated map outputs; an informing module that informs the job tracker of related information of the map output; and a provision module that, in response to a request from a reduce task tracker, provides the requested map outputs to the reduce task tracker; and a reduce task tracker, which comprises: an acquisition module that, in response to a reduce task distributed by the job tracker, acquires map outputs for key names including given version information from the map task trackers, wherein the acquired map outputs include the map outputs including the given version information and historical map outputs including the version information prior to the given version information; and a reduce task execution module that executes the reduce task on the acquired map outputs.
  • According to a fourth aspect of the present invention, a reduce task tracker for reducing data in a data center is provided, which comprises: an acquisition module that, in response to a reduce task distributed by a job tracker, acquires map outputs for key names including given version information from map task trackers, wherein the acquired map outputs include the map outputs including the given version information and historical map outputs including the version information prior to the given version information; and a reduce task execution module that executes the reduce task on the acquired map outputs.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • Embodiment(s) of the invention will now be described, by way of example only, with reference to the accompanying drawings in which:
  • FIG. 1 is a schematic diagram of an existing MapReduce architecture;
  • FIG. 2 is a flow chart of a MapReduce method for a data center according to an embodiment of the present invention;
  • FIG. 3 is a flow chart of an example of the map task tracker executing the map task in the embodiment shown in FIG. 2;
  • FIG. 4 is a flow chart of another example of the map task tracker executing the map task in the embodiment shown in FIG. 2;
  • FIG. 5 is a flow chart of an example of the reduce task tracker acquiring map outputs from the map task tracker in response to the reduce task distributed by the job tracker in the embodiment shown in FIG. 2;
  • FIG. 6 is a flow chart of another example of the reduce task tracker acquiring map outputs from the map task tracker in response to the reduce task distributed by the job tracker in the embodiment shown in FIG. 2;
  • FIG. 7 is a flow chart of a method for reducing data by a reduce task tracker in a data center according to an embodiment of the present invention;
  • FIG. 8 is a schematic block diagram of a MapReduce system for a data center according to an embodiment of the present invention;
  • FIG. 9 is a schematic block diagram of a map task tracker according to an embodiment of the present invention; and
  • FIG. 10 is a schematic block diagram of a reduce task tracker according to an embodiment of the present invention.
  • DETAILED DESCRIPTION
  • It is believed that the above and other objects, features and advantages of the present invention will become more apparent from the following detailed description of the preferred embodiments of the present invention taken in conjunction with the drawings.
  • FIG. 2 shows a flow chart of a MapReduce method for a data center according to an embodiment of the present invention. The present embodiment will be described in detail in conjunction with the figure.
  • In the embodiment, the data center includes a job tracker, map task trackers and reduce task trackers.
  • As shown in FIG. 2, at step S201, in response to a map task distributed by the job tracker, the map task tracker executes the map task to generate the map outputs including version information. In this step, the job tracker receives a job request from a client program, divides the job into multiple tasks including M map tasks and R reduce tasks, and distributes the map tasks or reduce tasks to the idle task trackers. When receiving the distributed task, the map task tracker starts to execute the map task. In the description of the present embodiment and subsequent embodiments, the case where the version information only includes a version value (i.e. the version information is the version value) will be primarily described.
  • FIG. 3 shows a flow chart of an example of the map task tracker executing the map task. As shown in FIG. 3, at step S301, the map task tracker receives the map task from the job tracker, wherein the map task includes storage positions for input data splits of the map task. Next, at step S302, the input data splits are read from the storage positions. The storage positions may be the map task tracker or other servers. At step S303, the map task tracker analyzes the read input data splits to generate a set of key-value pairs in the form of <key name (Key), key value (Value)>. Then, at step S304, the map task tracker assigns a version value Version to each of the key-value pair. Thus the form of the key-value pair becomes <Key, Value, Version>. By means of the version value, whether the input data splits are newly added data or not can be identified. Each time when the data addition occurs, a new version value will be assigned. At step S305, the map task tracker employs a map function to execute a map operation on the key-value pairs including the version value. Specifically, the key-value pairs including the version value are delivered to the map function specified by the user, and the map function executes mapping on the key names and key values without changing the version value, thereby forming the intermediate key-value pairs including the version value. The generated intermediate key-value pairs including the version value are buffered in a memory. At step S306, the partition operation is executed on the buffered intermediate key-value pairs. Specifically, the combine function and the partition function are applied to the buffered intermediate key-value pairs to generate the map output of the map task, wherein the key values of the same key name are aggregated together, i.e., the map output is represented as <Key, Value 1, Version, Value2, Version, . . . >.
  • FIG. 4 shows a flow chart of another example of the map task tracker executing the map task, wherein the steps S401, S402, S403 are identical with the steps S301, S302, S303 in the example shown in FIG. 3. In the present example, at step S404, the map function is used to execute the map operation on the generated key-value pairs to generate the intermediate key-value pairs. Then at step S405, the version value is assigned to each of the above intermediate key-value pairs and the intermediate key-value pairs including the version value are buffered in the memory. At step S406, the buffered intermediate key-value pairs including the version value are partitioned to generate the map output of the map task.
  • Returning to FIG. 2, at step S205, the map task tracker stores the map output generated in step S201. In the present embodiment, the map task tracker stores the map output in the storage region of the local hard disk according to the version value and the associated reduce task tracker (index identifications in the R reduce tasks may be used). In all map task trackers, the map outputs including the same key name are associated with the same reduce task tracker. Of course, those skilled in the art can understand that the map output can be stored in other ways besides based on the version value and the associated reduce task tracker.
  • Then, at step S210, the map task tracker informs the job tracker of the related information of the map output. In the present embodiment, the related information of the map output may include a job number, a map task number and the version information. Further, the related information may include a set of key names, i.e., the set of the key names involved in the map task. After the distributed map task is completed, the map task tracker informs the job tracker of the task completion, and transmits the related information of the map output to the job tracker, so that the job tracker can provide it to the reduce task tracker. Before transmitting the set of key names to the job tracker, the map task tracker may use Bloom Filter to process these key names to save the storage space. The Bloom Filter is well known to those skilled in the art, and the description thereof will be omitted herein.
  • At step S215, in response to the reduce task distributed by the job tracker, the reduce task tracker acquires map outputs for key names including a given version value from map task trackers, wherein the acquired map outputs include the map outputs including the given version value and the historical map outputs including the version values prior to the given version value. In the present embodiment, the communication between the reduce task tracker and the map task tracker is based on a pull model. In this step, after the job tracker knows that all map tasks are completed, it informs the reduce task tracker to begin to execute the reduce task.
  • FIG. 5 shows a flow chart of an example of the reduce task tracker acquiring map outputs from the map task trackers in response to the reduce task distributed by the job tracker. The example is suitable for the case where the related information includes the job number, the map task number and the version value. As shown in FIG. 5, at step S501, the reduce task tracker receives the reduce task from the job tracker, wherein the reduce task includes the given version value. The given version value can be used to define a range of the map outputs required for the reduce task. Then, at step S502, the reduce task tracker requests the map outputs from all map task trackers, wherein the request includes the given version value. After receiving the above request for the map outputs, at step S503, the map task trackers find the map outputs from the associated local storage regions based on the given version value and an identity of the reduce task tracker. Then, at step S504, the map task trackers transmits the found map outputs to the reduce task tracker. After receiving the transmitted map outputs including the given version value, at step S505, the reduce task tracker extracts the key names from the received map outputs, these key names being the key names to be processed by the reduce tasks to be executed. Then, at step S506, based on the extracted key names, the reduce task tracker requests the historical map outputs for these key names including the version values prior to the given version value from all map task trackers. After receiving the request for the historical map outputs for the key names, at step S507, the map task trackers find the historical map outputs for these key names, and at step S508, the map task trackers transmit the found historical map outputs to the reduce task tracker. The reduce task tracker receives these historical map outputs and alternatively combines the historical map outputs with the previously received map outputs including the given version value based on the key names. In the example shown in FIG. 5, the reduce task tracker acquires the desired map outputs through two pull operations.
  • FIG. 6 shows a flow chart of another example of the reduce task tracker acquiring map outputs from the map task trackers. The example is suitable for the case where the related information includes the job number, the map task number, the version value and a set of key names. As shown in FIG. 6, at step S601, the reduce task tracker receives the reduce task from the job tracker, wherein the reduce task includes the given version value and a set of given key names. The set of given key names indicates the key names to be processed by the distributed reduce task. Then, at step S602, the reduce task tracker sends a request to all map task trackers for map outputs, wherein the request includes the given version value and the set of given key names. After receiving the above request for the map outputs, at step S603, the map task trackers find the map outputs for all the key names in the given key name set, wherein the map outputs for each of the key names include the map outputs for the key name including the given version value and the historical map outputs for the key name including the version values prior to the given version value. At step S604, the map task trackers transmit the found map outputs to the reduce task tracker. The reduce task tracker receives the map outputs from the map task trackers. In the example shown in FIG. 6, when the job tracker specifies the set of key names required for the reduce task, the reduce task tracker may obtain the desired map outputs through only one pull operation.
  • In this example, if the map task tracker uses the Bloom Filter to process the set of key names when informing the job tracker of the related information, after receiving the request, the map task tracker also uses the Bloom Filter to determine whether it stores the map outputs for the key names in the set of key names.
  • Returning to FIG. 2, at step S220, the reduce task tracker executes the reduce task on the acquired map outputs. In this step, the reduce task tracker sorts the acquired map outputs, so that the map outputs for the same key name are aggregated together. Thus the sorted map outputs for each of the key names may include the map outputs for the key name including the given version value and the historical map outputs for the key name including the version values prior to the given version value from different map task trackers. Then, the reduce task tracker uses the reduce function to execute the reduce operation on the sorted map outputs, that is, the sorted map outputs are delivered to the reduce function, and the outputs generated by the reduce function are added into the final output file. After the reduce task is completed, the reduce task tracker informs the job tracker of the reduce task completion.
  • It can be seen from the above description that in the present embodiment the version information (e.g. the version value, etc.) is introduced to identify whether the data addition occurs and the reduce task tracker only acquires the intermediate key-value pairs affected by the data addition from the map task tracker and executes the reduce operation without acquiring other unaffected intermediate key-value pairs, thereby efficiently reducing the number of the key-value pairs to be processed and the required resources when the data addition occurs and further reducing the processing latency.
  • Under the same inventive concept, FIG. 7 shows a flow chart of a method for reducing data by the reduce task tracker in the data center according to an embodiment of the present invention. The method of the present embodiment is a part of the MapReduce method performed by the reduce task tracker in the embodiment shown in FIG. 2, and therefore, the description of the same part thereof is omitted appropriately.
  • As shown in FIG. 7, at step S701, in response to the reduce task distributed by the job tracker, the reduce task tracker acquires map outputs for the key names including the given version value from the map task tracker, and the acquired map outputs include the map outputs including the given version value and the historical map outputs including the version values prior to the given version value.
  • If the reduce task received by the reduce task tracker from the job tracker includes the given version value, the reduce task tracker requests the map outputs from all map task trackers, wherein the request includes the above given version value, then receives the map outputs including the given version value and associated with the reduce task tracker from the map task tracker, and extracts the key names from these map outputs. As described above, the extracted key names are the key names to be processed by the reduce tasks to be executed later. The reduce task tracker requests the historical map outputs for the extracted key names including the versions prior to the given version value from all map task trackers, and receives the historical map outputs for these key names from the map task trackers.
  • If the reduce task received by the reduce task tracker from the job tracker includes the given version value and the set of given key names, the reduce task tracker requests the map outputs from all map task trackers, wherein the request includes the above given version value and the set of given key names. Then the reduce task tracker receives the map outputs for all the key names in the set of given key names from the map task tracker, wherein the map outputs for each of the key names include the map outputs for the key name including the given version value and the historical map outputs for the key name including the version values prior to the given version value.
  • Then, at step S705, the reduce task tracker executes the reduce task on the acquired map outputs. Specifically, the reduce task tracker sorts the acquired map outputs so that the map outputs for the same key name are aggregated together, and then executes the reduce operation on the sorted map outputs with the reduce function.
  • Under the same inventive concept, FIG. 8 shows a schematic block diagram of a MapReduce system 800 for a data center according to an embodiment of the present invention. Referring to the FIG., the present embodiment will be described in detail, wherein for the same parts as in the previous embodiments, the description thereof is omitted appropriately.
  • As shown in FIG. 8, the MapReduce system 800 of the embodiment includes a job tracker 801, multiple map task trackers 802 and multiple reduce task trackers 803. The map task tracker 802 further includes: a map task execution module 8021 which, in response to the map task distributed by the job tracker 801, executes the map task to generate the map output including the version information; a storage module 8022 which stores the map output generated by the map task execution module 8021; an informing module 8023 which informs the job tracker 801 of related information of the map output; and a provision module 8024 which, in response to the request from the reduce task tracker 803, provides the requested map outputs to the reduce task tracker 803. The reduce task tracker 803 further comprises: an acquisition module 8031 which, in response to reduce task distributed by the job tracker 801, acquires the map outputs for key names including the given version information from the map task tracker 802, wherein the acquired map outputs include the map outputs including the given version information and the historical map outputs including the version information prior to the given version information; and a reduce task execution module 8032 which executes the reduce task on the acquired map outputs.
  • It shall be noted that the MapReduce system 800 of the present embodiment can operatively implement the MapReduce method for a data center as shown in FIG. 2.
  • FIG. 9 further shows a schematic block diagram of the map task tracker 802, wherein the version information includes the version value. As shown in FIG. 9, in the map task execution module 8021, a task reception unit 901 receives the map task from the job tracker 801. The storage positions for the input data splits of the map task are indicated in the map task. Then, a data read unit 902 reads the input data splits from the indicated storage positions, and provides them to an analysis unit 903 for analysis to generate the key-value pairs. A version management unit 904 assigns the version value to each of the key-value pairs generated by the analysis unit 903. Then, the key-value pairs including the version value are transmitted to a mapping unit 905 to execute the map operation with the map function to generate the intermediate key-value pairs. Finally, a partition unit 906 executes the partition operation on the generated intermediate key-value pairs to generate the map output of the map task.
  • In another embodiment, the version management unit 904 in the map task execution module 8021 assigns the version value to each of the intermediated key-value pairs outputted by the mapping unit 905 after the map operation.
  • The map outputs outputted by the map task execution module 8021 are stored in the storage module 8022. In the present embodiment, the storage module 8022 is configured to store the map outputs based on the version value and the associated reduce task tracker 803. Of course, those skilled in the art can understand that the storage module 8022 may also store the map outputs in other ways. When the map tasks are completed, the informing module 8023 informs the job tracker 801 of the map task completion and transmits the related information of the map output to it. As described above, the related information may include the job number, the map task number and the version information. Additionally the related information may further include a set of key names.
  • If the related information includes the job number, the map task number and the version value, when the reduce task tracker 803 requests the map outputs from the map task tracker 802, in the provision module 8024, a request reception unit 911 receives the request including the given version value. Then, based on the given version value and the identity of the reduce task tracker 803 which sends the request, a finding unit 912 finds the corresponding map outputs in the associated local regions of the map task tracker 802, and the found map outputs are transmitted by a transmitting unit 913 to the reduce task tracker 803. Then the request reception unit 911 receives a request for the historical map outputs for the key names including the version values prior to the given version value from the reduce task tracker 803. The finding unit 912 finds the historical map outputs for these key names and the transmitting unit 913 transmits these historical map outputs to the reduce task tracker 803.
  • In addition, if the related information includes the job number, the map task number, the version value and the set of key names, when the reduce task tracker 803 requests the map outputs from the map task tracker 802, in the provision module 8024, the request reception unit 911 receives the request for the map outputs, wherein the request includes the given version value and the set of given key names. Then the finding unit 912 find the map outputs for all the key names in the set of given key names, wherein the map outputs for each of the key names include the map outputs for the key name including the given version value and the historical map outputs for the key name including the version values prior to the given version value, and the transmitting unit 913 transmits these map outputs to the reduce task tracker 803.
  • FIG. 10 further shows a schematic block diagram of the reduce task tracker 803. As shown in FIG. 10, in the acquisition module 8031, a task reception unit 1001 receives the reduce task from the job tracker 801. If the received reduce task includes the given version value, a request unit 1002 requests the map outputs from the map task tracker 802, wherein the request includes the given version value. Then a map output reception unit 1003 receives the map outputs including the given version value. An extraction unit 1004 extracts the key names from these map outputs, and the request unit 1002 requests the historical map outputs for the extracted key names including the version values prior to the given version value from all map task trackers 802. The map output reception unit 1003 receives the historical map outputs for these key names from the map task trackers 802. If the received reduce task includes the given version value and the set of given key names, the request unit 1002 requests the map outputs from the map task tracker 802, wherein the request includes the given version value and the set of given key names. Then the map output reception unit 1003 receives the map outputs for all the key names in the set of given key names from the map task tracker 802, wherein the map outputs for each of the key names include the map outputs for the key name including the given version name and the historical map outputs for the key name including the version values prior to the given version value.
  • Then, in the reduce task execution module 8032, a sorting unit 1011 sorts the map outputs acquired by the acquisition module 8031 so that the map outputs for the same key name are aggregated together, and then a reduce unit 1012 executes the reduce operation on these sorted map outputs with the reduce function.
  • It shall be noted that the reduce task tracker 803 of the present embodiment can operatively implement the method for reducing data by a reduce task tracker in a data center as shown in FIG. 7.
  • The MapReduce method for a data center and the method for reducing data by a reduce task tracker in a data center disclosed in the above embodiments may be implemented in software, hardware, or combination of software and hardware. The hardware portion may be implemented by application specific logic. For example, the MapReduce system and its components as well as the reduce task tracker and its components may be implemented by hardware circuits such as Large Scale Integrated circuits or gate arrays, semiconductors such as logic chips or transistors or programmable hardware devices such as field programmable gate array, programmable logic devices etc., or can be implemented by software which can be executed by various processors, or can be implemented by the combination of the above hardware circuit and software. The software portion can be stored in memory and executed by an appropriate instruction execution system such as microprocessor, personal computer (PC) or mainframe.
  • Although the MapReduce method and system for a data center and the method for reducing data by a reduce task tracker in a data center as well as the reduce task tracker of the present invention have been described in detail through some exemplary embodiments, these embodiments are not exhaustive, and those skilled in the art can realize various changes and modifications within the spirit and scope of the present invention. Therefore, the present invention is not limited to these embodiments, and the scope of which is only defined by appended claims.

Claims (26)

1. A method for a operating data center, wherein the data center includes a job tracker, map task trackers and reduce task trackers, the method comprising:
in response to a map task distributed by the job tracker, executing, via a map task tracker, the map task to generate a map output including version information;
storing, via the map task tracker, the generated map output;
informing, via the map task tracker, the job tracker of related information of the map output;
in response to a reduce task distributed by the job tracker, acquiring, via the reduce task tracker, map outputs for key names including given version information from the map task trackers, wherein the acquired map outputs include the map outputs including the given version information and historical map outputs including the version information prior to the given version information; and
executing, via the reduce task tracker, the reduce task on the acquired map outputs.
2. The method according to claim 1, wherein the version information includes a version value.
3. The method according to claim 2, wherein the step of, in response to a map task distributed by the job tracker, executing, via the map task tracker, the map task to generate a map output including version information comprises:
receiving from the job tracker the map task which includes storage positions for input data splits of the map task;
reading the input data splits from the storage positions;
analyzing the input data splits to generate key-value pairs;
assigning a version value to each of the key-value pairs;
executing a map operation on the key-value pairs including the version value with a map function to generate intermediate key-value pairs including the version value; and
executing a partition operation on the intermediate key-value pairs to generate the map output.
4. The method according to claim 2, wherein the step of, in response to a map task distributed by the job tracker, executing, via the map task tracker, the map task to generate a map output including version information comprises:
receiving from the job tracker the map task which includes storage positions for input data splits of the map task;
reading the input data splits from the storage positions;
analyzing the input data splits to generate key-value pairs;
executing a map operation on the generated key-value pairs with a map function to generate intermediate key-value pairs;
assigning a version value to each of the intermediate key-value pairs; and
executing a partition operation on the intermediate key-value pairs including the version value to generate the map output.
5. The method according to claim 1, wherein the related information includes a job number, a map task number and the version information.
6. The method according to claim 5, wherein the step of, in response to a reduce task distributed by the job tracker, acquiring, via the reduce task tracker, map outputs for key names including given version information from the map task trackers comprises:
receiving, via the reduce task tracker, from the job tracker a reduce task which includes a given version value and requesting the map outputs including the given version value from the map task trackers;
in response to receiving the request for the map outputs, Finding, the map task trackers, the map outputs including the given version value and associated with the reduce task tracker, and transmitting the found map outputs to the reduce task tracker;
receiving, via the reduce task tracker, the transmitted map outputs, extracting the key names from the received map outputs, and requesting the historical map outputs for the extracted key names including the version values prior to the given version value from the map task trackers;
in response to receiving the request for the historical map outputs for the extracted key names including the version values prior to the given version value, finding, via the map task trackers, the historical map outputs for the key names and transmitting the historical map outputs to the reduce task tracker; and
receiving, the reduce task tracker, the historical map outputs.
7. The method according to claim 5, wherein the related information further comprises a set of key names.
8. The method according to claim 7, wherein the step of, in response to a reduce task distributed by the job tracker, acquiring, via the reduce task tracker, map outputs for key names including given version information from the map task trackers comprises:
receiving, via the reduce task tracker, from the job tracker a reduce task which includes a given version value and a set of given key names, and requesting map outputs from the map task trackers, wherein the request includes the given version value and the set of given key names;
in response to receiving the request for the map outputs, finding, via the map task trackers, the map outputs for all the key names in the set of given key name, wherein the found map outputs for each of the key names include the map outputs for the key name including the given version value and the historical map outputs for the key name including the version values prior to the given version value, and transmitting the found map outputs to the reduce task tracker; and
receiving, via the reduce task tracker, the transmitted map outputs from the map task trackers.
9. The method according to claim 1, wherein the step of the reduce task tracker executing the reduce tasks on the acquired map outputs comprises:
sorting the acquired map outputs so that the map outputs for the same key name are aggregated together; and
executing a reduce operation on the sorted map outputs with a reduce function.
10. A method for reducing data by a reduce task tracker in a data center, comprising:
in response to a reduce task distributed by a job tracker, acquiring map outputs for key names including given version information from map task trackers, wherein the acquired map outputs include the map outputs with the given version information and historical map outputs with the version information prior to the given version information; and
executing the reduce task on the acquired map outputs.
11. The method according to claim 10, wherein the step of, in response to a reduce task distributed by a job tracker, acquiring map outputs for key names including given version information from map task trackers comprises:
receiving from the job tracker the reduce task which includes a given version value;
requesting the map outputs including the given version value from the map task tracker;
receiving the map outputs including the given version value and associated with the reduce task tracker from the map task trackers;
extracting key names from the received map outputs;
requesting the historical map outputs for the extracted key names including the version values prior to the give version value from the map task trackers; and
receiving the historical map outputs for the key names including the version values prior to the given version value from the map task trackers.
12. The method according to claim 10, wherein the step of, in response to a reduce task distributed by a job tracker, acquiring map outputs for key names including given version information from map task trackers comprises:
receiving from the job tracker the reduce task which includes a given version value and a set of given key names;
requesting map outputs from the map task trackers, wherein the request includes the given version value and the set of given key name; and
receiving the map outputs for all the key names in the set of given key names from the map task trackers, wherein the map outputs for each of the key names include the map outputs for the key name with the given version value and the historical map outputs for the key name with the version values prior to the given version value.
13. The method according to claim 10, wherein the step of executing the reduce tasks on the acquired map outputs comprises:
sorting the acquired map outputs so that the map outputs for the same key name are aggregated together; and
executing a reduce operation on the sorted map outputs with a reduce function.
14. A data center system, comprising:
a job tracker that specifies a map task tracker to execute a map task and a reduce task tracker to execute a reduce task;
map task trackers, each of which comprising:
a map task execution module that, in response to a map task distributed by the job tracker, executes the map task to generate a map output including version information;
a storage module that stores the generated map outputs;
an informing module that informs the job tracker of related information of the map output; and
a provision module that, in response to a request from a reduce task tracker, provides the requested map outputs to the reduce task tracker; and
reduce task trackers, each of which comprising:
an acquisition module that, in response to a reduce task distributed by the job tracker, acquires map outputs for key names including given version information from the map task trackers, wherein the acquired map outputs include the map outputs including the given version information and historical map outputs including the version information prior to the given version information; and
a reduce task execution module that executes the reduce task on the acquired map outputs.
15. The system according to claim 14, wherein the version information includes a version value.
16. The system according to claim 15, wherein the map task execution module comprises:
a task reception unit that receives from the job tracker the map task which includes storage positions for input data splits of the map task;
a data reading unit that reads the input data splits from the storage positions;
an analysis unit that analyzes the input data splits to generate key-value pairs;
a version management unit that assigns a version value to each of the key-value pairs;
a map unit that executes a map operation on the key-value pairs including the version value with a map function to generate intermediate key-value pairs including the version value; and
a partition unit that executes a partition operation on the intermediate key-value pairs to generate the map output.
17. The system according to claim 15, wherein the map task execution module comprises:
a task reception unit that receives from the job tracker the map task which includes storage positions for input data splits of the map task;
a data reading unit that reads the input data splits from the storage positions;
an analysis unit that analyzes the input data splits to generate key-value pairs;
a map unit that executes a map operation on the generated key-value pairs with a map function to generate intermediate key-value pairs;
a version management unit that assigns a version value to each of the intermediate key-value pairs; and
a partition unit that executes a partition operation on the intermediate key-value pairs including the version value to generate the map output.
18. The system according to claim 14, wherein the related information includes a job number, a map task number and the version information.
19. The system according to claim 18, wherein the acquisition module comprises:
a task reception unit that receives from the job tracker the reduce task which includes a given version value;
a requesting unit that requests the map outputs including the given version value from the map task trackers, and requests the historical map outputs for key names including the version values prior to the given version value from the map task trackers;
a map output reception unit that receives the map outputs including the given version value and associated with the reduce task tracker from the map task trackers, and receives the historical map outputs for the key names including the version values prior to the given version value from the map task trackers;
an extraction unit that extracts the key names from the map outputs including the given version value and associated with the reduce task trackers;
wherein the provision module comprises:
a request reception unit that receives the request for the map outputs including the given version value from the reduce task tracker, and receives a request for the historical map outputs for the key names including the version values prior to the given version value from the reduce task tracker;
a finding unit that finds the map outputs including the given version value and associated with the reduce task tracker, and finds the historical map outputs for the key names including the version values prior to the given version value; and
a transmitting unit that transmits the map outputs including the given version value and associated with the reduce task tracker to the reduce task tracker, and transmits the historical map outputs for the key names including the version values prior to the given version value to the reduce task tracker.
20. The system according to claim 18, wherein the related information further comprises a set of key names.
21. The system according to claim 20, wherein the acquisition module comprises:
a task reception unit that receives from the job tracker the reduce task which includes a given version value and a set of given key names;
a requesting unit that requests map outputs from the map task trackers, wherein the request includes the given version value and the set of given key name;
a map output reception unit that receives the map outputs from the map task trackers;
wherein the provision module comprises:
a request reception unit that receives the request for the map outputs from the reduce task tracker, wherein the request includes the given version value and the set of given key name;
a finding unit that finds the map outputs for all the key names in the set of given key name, wherein the found map outputs for each of the key names include the map outputs for the key name including the given version value and the historical map outputs for the key name including the version values prior to the given version value; and
a transmitting unit that transmits the found map outputs to the reduce task tracker.
22. The system according to claim 14, wherein the reduce task execution module comprises:
a sorting unit that sorts the acquired map outputs so that the map outputs for the same key name are aggregate together; and
a reduce unit that executes a reduce operation on the sorted map outputs with a reduce function.
23. A reduce task tracker for reducing data in a data center, comprising:
an acquisition module that, in response to a reduce task distributed by a job tracker, acquires map outputs for key names including given version information from map task trackers, wherein the acquired map outputs include the map outputs with the given version information and historical map outputs with the version information prior to the given version information; and
a reduce task execution module that executes the reduce task on the acquired map outputs.
24. The reduce task tracker according to claim 23, wherein the acquisition module comprises:
a task reception unit that receives from the job tracker the reduce task which includes a given version value;
a requesting unit that requests the map outputs including the given version value from the map task trackers, and requests the historical map outputs for key names including the version values prior to the given version value from the map task trackers;
a map output reception unit that receives the map outputs including the given version value and associated with the reduce task tracker from the map task trackers, and receives the historical map outputs for the key names including the version values prior to the given version value from the map task trackers; and
an extraction unit that extracts the key names from the map outputs including the given version value and associated with the reduce task tracker.
25. The reduce task tracker according to claim 23, wherein the acquisition module comprises:
a task reception unit that receives from the job tracker the reduce task which includes a given version value and a set of given key names;
a requesting unit that requests map outputs from the map task trackers, wherein the request includes the given version value and the set of given key names; and
a map output reception unit that receives the map outputs for all the key names in the set of given key names from the map task trackers, wherein the received map outputs for each of the key names include the map outputs for the key name including the given version value and the historical map outputs for the key name including the version values prior to the given version value.
26. The reduce task tracker according to claim 23, wherein the reduce task execution module comprises:
a sorting unit that sorts the received map outputs so that the map outputs for the same key name are aggregated together; and
a reduce unit that executes a reduce operation on the sorted map outputs with a reduce function.
US13/643,595 2010-04-30 2011-04-20 Generating map task output with version information during map task execution and executing reduce tasks using the output including version information Expired - Fee Related US9378053B2 (en)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN201010171637 2010-04-30
CN2010101716379A CN102236581B (en) 2010-04-30 2010-04-30 Mapping reduction method and system thereof for data center
CN201010171637.9 2010-04-30
PCT/EP2011/056370 WO2011134875A1 (en) 2010-04-30 2011-04-20 Data center operation

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2011/056370 A-371-Of-International WO2011134875A1 (en) 2010-04-30 2011-04-20 Data center operation

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/150,902 Continuation US10114682B2 (en) 2010-04-30 2016-05-10 Method and system for operating a data center by reducing an amount of data to be processed

Publications (2)

Publication Number Publication Date
US20130104135A1 true US20130104135A1 (en) 2013-04-25
US9378053B2 US9378053B2 (en) 2016-06-28

Family

ID=44263053

Family Applications (3)

Application Number Title Priority Date Filing Date
US13/643,595 Expired - Fee Related US9378053B2 (en) 2010-04-30 2011-04-20 Generating map task output with version information during map task execution and executing reduce tasks using the output including version information
US15/150,902 Expired - Fee Related US10114682B2 (en) 2010-04-30 2016-05-10 Method and system for operating a data center by reducing an amount of data to be processed
US16/106,917 Active 2031-10-29 US10831562B2 (en) 2010-04-30 2018-08-21 Method and system for operating a data center by reducing an amount of data to be processed

Family Applications After (2)

Application Number Title Priority Date Filing Date
US15/150,902 Expired - Fee Related US10114682B2 (en) 2010-04-30 2016-05-10 Method and system for operating a data center by reducing an amount of data to be processed
US16/106,917 Active 2031-10-29 US10831562B2 (en) 2010-04-30 2018-08-21 Method and system for operating a data center by reducing an amount of data to be processed

Country Status (4)

Country Link
US (3) US9378053B2 (en)
EP (1) EP2564318A1 (en)
CN (1) CN102236581B (en)
WO (1) WO2011134875A1 (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130339965A1 (en) * 2012-06-18 2013-12-19 International Business Machines Corporation Sequential cooperation between map and reduce phases to improve data locality
US20140143787A1 (en) * 2010-08-30 2014-05-22 Adobe Systems Incorporated Methods and apparatus for resource management in cluster computing
US9201690B2 (en) 2011-10-21 2015-12-01 International Business Machines Corporation Resource aware scheduling in a distributed computing environment
US9342355B2 (en) 2013-06-20 2016-05-17 International Business Machines Corporation Joint optimization of multiple phases in large data processing
US9354938B2 (en) 2013-04-10 2016-05-31 International Business Machines Corporation Sequential cooperation between map and reduce phases to improve data locality
US9747127B1 (en) * 2012-03-30 2017-08-29 EMC IP Holding Company LLC Worldwide distributed job and tasks computational model
CN111273937A (en) * 2020-01-18 2020-06-12 四川九洲空管科技有限责任公司 Remote upgrading method based on STM32F746 processor

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102236581B (en) 2010-04-30 2013-08-14 国际商业机器公司 Mapping reduction method and system thereof for data center
JP5888336B2 (en) * 2011-10-06 2016-03-22 富士通株式会社 Data processing method, distributed processing system, and program
CN102426609B (en) * 2011-12-28 2013-02-13 厦门市美亚柏科信息股份有限公司 Index generation method and index generation device based on MapReduce programming architecture
CN103186416B (en) * 2011-12-29 2016-06-22 比亚迪股份有限公司 Build the method for multi-task multi-branch process, state machine and the method for execution
CN102970158B (en) * 2012-11-05 2017-02-08 广东睿江云计算股份有限公司 Log storage and processing method and log server
CN103078941B (en) * 2012-12-31 2016-01-20 中金数据系统有限公司 A kind of method for scheduling task of distributed computing system
CN104216684B (en) * 2013-06-04 2017-05-31 阿里巴巴集团控股有限公司 A kind of multi-core parallel concurrent system and its data processing method
CN103327128A (en) * 2013-07-23 2013-09-25 百度在线网络技术(北京)有限公司 Intermediate data transmission method and system for MapReduce
CN104346380B (en) * 2013-07-31 2018-03-09 华为技术有限公司 Data reordering method and system based on MapReduce model
US10326824B2 (en) * 2013-12-17 2019-06-18 Excalibur Ip, Llc Method and system for iterative pipeline
CN104036039B (en) * 2014-06-30 2017-09-29 浪潮(北京)电子信息产业有限公司 The method for parallel processing and system of a kind of data
CN106202092B (en) * 2015-05-04 2020-03-06 阿里巴巴集团控股有限公司 Data processing method and system
CN106844288B (en) 2015-12-07 2022-03-22 创新先进技术有限公司 Random character string generation method and device
CN107430510A (en) * 2015-12-31 2017-12-01 华为技术有限公司 Data processing method, device and system
US10462220B2 (en) 2016-09-16 2019-10-29 At&T Mobility Ii Llc Cellular network hierarchical operational data storage

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080120314A1 (en) * 2006-11-16 2008-05-22 Yahoo! Inc. Map-reduce with merge to process multiple relational datasets
US7590620B1 (en) * 2004-06-18 2009-09-15 Google Inc. System and method for analyzing data records
US20090313635A1 (en) * 2008-06-12 2009-12-17 Yahoo! Inc. System and/or method for balancing allocation of data among reduce processes by reallocation
US7650331B1 (en) * 2004-06-18 2010-01-19 Google Inc. System and method for efficient large-scale data processing
US20100122065A1 (en) * 2004-06-18 2010-05-13 Jeffrey Dean System and Method for Large-Scale Data Processing Using an Application-Independent Framework
US20100257198A1 (en) * 2009-04-02 2010-10-07 Greeenplum, Inc. Apparatus and method for integrating map-reduce into a distributed relational database
US8510538B1 (en) * 2009-04-13 2013-08-13 Google Inc. System and method for limiting the impact of stragglers in large-scale parallel data processing
US8682998B2 (en) * 2008-10-31 2014-03-25 Software Ag Method and server cluster for map reducing flow services and large documents
US8832173B2 (en) * 2009-01-20 2014-09-09 Sap Ag System and method of multithreaded processing across multiple servers
US8943057B2 (en) * 2007-12-12 2015-01-27 Oracle America, Inc. Method and system for distributed bulk matching and loading

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8630973B2 (en) 2004-05-03 2014-01-14 Sap Ag Distributed processing system for calculations based on objects from massive databases
TWI317909B (en) 2004-09-10 2009-12-01 Hon Hai Prec Ind Co Ltd System and method for mould production scheduling
US20070220026A1 (en) 2006-03-17 2007-09-20 Microsoft Corporation Efficient caching for large scale distributed computations
US20080046862A1 (en) 2006-08-18 2008-02-21 Juergen Sattler Business task management
US7926058B2 (en) * 2007-02-06 2011-04-12 Mba Sciences, Inc. Resource tracking method and apparatus
US8230070B2 (en) * 2007-11-09 2012-07-24 Manjrasoft Pty. Ltd. System and method for grid and cloud computing
CN101183368B (en) * 2007-12-06 2010-05-19 华南理工大学 Method and system for distributed calculating and enquiring magnanimity data in on-line analysis processing
CN102236581B (en) * 2010-04-30 2013-08-14 国际商业机器公司 Mapping reduction method and system thereof for data center

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7590620B1 (en) * 2004-06-18 2009-09-15 Google Inc. System and method for analyzing data records
US7650331B1 (en) * 2004-06-18 2010-01-19 Google Inc. System and method for efficient large-scale data processing
US20100122065A1 (en) * 2004-06-18 2010-05-13 Jeffrey Dean System and Method for Large-Scale Data Processing Using an Application-Independent Framework
US20080120314A1 (en) * 2006-11-16 2008-05-22 Yahoo! Inc. Map-reduce with merge to process multiple relational datasets
US8943057B2 (en) * 2007-12-12 2015-01-27 Oracle America, Inc. Method and system for distributed bulk matching and loading
US20090313635A1 (en) * 2008-06-12 2009-12-17 Yahoo! Inc. System and/or method for balancing allocation of data among reduce processes by reallocation
US8682998B2 (en) * 2008-10-31 2014-03-25 Software Ag Method and server cluster for map reducing flow services and large documents
US8832173B2 (en) * 2009-01-20 2014-09-09 Sap Ag System and method of multithreaded processing across multiple servers
US20100257198A1 (en) * 2009-04-02 2010-10-07 Greeenplum, Inc. Apparatus and method for integrating map-reduce into a distributed relational database
US8510538B1 (en) * 2009-04-13 2013-08-13 Google Inc. System and method for limiting the impact of stragglers in large-scale parallel data processing

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Arun C Murthy, "programminng Hadoop Map-Reduce", Yahoo, 2008, pages 1-42 *
Fischer et al (" Population a release history database from version control and bug tracking systems", IEEE, 2003, pages 1-10). *
Lu et al., "HadoopToSQL, a MapReduce Query optimizer", April 13-16, 2010, ACM, pages 251-264 *
Yahoo developer Network, "MapReduce", December 27,2009; Yahoo developer , pages 1-14 *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140143787A1 (en) * 2010-08-30 2014-05-22 Adobe Systems Incorporated Methods and apparatus for resource management in cluster computing
US9262218B2 (en) * 2010-08-30 2016-02-16 Adobe Systems Incorporated Methods and apparatus for resource management in cluster computing
US10067791B2 (en) 2010-08-30 2018-09-04 Adobe Systems Incorporated Methods and apparatus for resource management in cluster computing
US9201690B2 (en) 2011-10-21 2015-12-01 International Business Machines Corporation Resource aware scheduling in a distributed computing environment
US9747127B1 (en) * 2012-03-30 2017-08-29 EMC IP Holding Company LLC Worldwide distributed job and tasks computational model
US20130339965A1 (en) * 2012-06-18 2013-12-19 International Business Machines Corporation Sequential cooperation between map and reduce phases to improve data locality
US20130339966A1 (en) * 2012-06-18 2013-12-19 International Business Machines Corporation Sequential cooperation between map and reduce phases to improve data locality
US8924978B2 (en) * 2012-06-18 2014-12-30 International Business Machines Corporation Sequential cooperation between map and reduce phases to improve data locality
US8924977B2 (en) * 2012-06-18 2014-12-30 International Business Machines Corporation Sequential cooperation between map and reduce phases to improve data locality
US9354938B2 (en) 2013-04-10 2016-05-31 International Business Machines Corporation Sequential cooperation between map and reduce phases to improve data locality
US9342355B2 (en) 2013-06-20 2016-05-17 International Business Machines Corporation Joint optimization of multiple phases in large data processing
CN111273937A (en) * 2020-01-18 2020-06-12 四川九洲空管科技有限责任公司 Remote upgrading method based on STM32F746 processor

Also Published As

Publication number Publication date
CN102236581A (en) 2011-11-09
US9378053B2 (en) 2016-06-28
US10114682B2 (en) 2018-10-30
US20160253220A1 (en) 2016-09-01
US20180357111A1 (en) 2018-12-13
US10831562B2 (en) 2020-11-10
CN102236581B (en) 2013-08-14
WO2011134875A1 (en) 2011-11-03
EP2564318A1 (en) 2013-03-06

Similar Documents

Publication Publication Date Title
US10831562B2 (en) Method and system for operating a data center by reducing an amount of data to be processed
US10447772B2 (en) Managed function execution for processing data streams in real time
CN111767143B (en) Transaction data processing method, device, equipment and system
WO2019114766A1 (en) Data desensitising method, server, terminal, and computer-readable storage medium
US20190068690A1 (en) Automated management of resource attributes across network-based services
US10338958B1 (en) Stream adapter for batch-oriented processing frameworks
US9794135B2 (en) Managed service for acquisition, storage and consumption of large-scale data streams
CN111258978B (en) Data storage method
CN112449750A (en) Log data collection method, log data collection device, storage medium, and log data collection system
US20150135255A1 (en) Client-configurable security options for data streams
US9953071B2 (en) Distributed storage of data
US10860604B1 (en) Scalable tracking for database udpates according to a secondary index
US9990403B2 (en) System and a method for reasoning and running continuous queries over data streams
US10182104B1 (en) Automatic propagation of resource attributes in a provider network according to propagation criteria
US10262024B1 (en) Providing consistent access to data objects transcending storage limitations in a non-relational data store
US9760576B1 (en) System and method for performing object-modifying commands in an unstructured storage service
JP2021508867A (en) Systems, methods and equipment for querying databases
CN113326305A (en) Method and device for processing data
US9659041B2 (en) Model for capturing audit trail data with reduced probability of loss of critical data
US9537941B2 (en) Method and system for verifying quality of server
Chen et al. A static resource allocation framework for Grid‐based streaming applications
CN112650570B (en) Dynamically-extensible distributed crawler system, data processing method and device
Lee et al. The Naming Service of Multi-Agent for the Sensor Network Applications.
Revathi Performance tuning and scheduling of large data set analysis in map reduce paradigm by optimal configuration using Hadoop
CN117633111A (en) ClickHouse-based request processing method, device, equipment and medium

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CAI, BIN;XIANG, ZHE;XUE, WEI;AND OTHERS;SIGNING DATES FROM 20121026 TO 20121029;REEL/FRAME:029576/0908

STCF Information on status: patent grant

Free format text: PATENTED CASE

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20200628