MergeSort

本文介绍了如何使用Apache Hadoop的MapReduce框架,结合自定义Mapper、Reducer和Partitioner,实现并行的归并排序算法。通过将输入数据切分成多个部分,利用分布式计算资源,提高了排序效率。
摘要由CSDN通过智能技术生成

import java.io.IOException;

import org.apache.hadoop.conf.Configuration;

import org.apache.hadoop.fs.Path;

import org.apache.hadoop.io.IntWritable;

import org.apache.hadoop.io.Text;

import org.apache.hadoop.mapreduce.Job;

import org.apache.hadoop.mapreduce.Mapper;

import org.apache.hadoop.mapreduce.Partitioner;

import org.apache.hadoop.mapreduce.Reducer;

import org.apache.hadoop.mapreduce.lib.input.FileInputFormat;

import org.apache.hadoop.mapreduce.lib.output.FileOutputFormat;

import org.apache.hadoop.util.GenericOptionsParser;

public class MergeSort {

 public static class Map extends Mapper<Object, Text, IntWritable, IntWritable>{

  

  private static IntWritable data = new IntWritable();

  public void map(Object key, Text value, Context context) throws IOException,InterruptedException{

   String text = value.toString();

   data.set(Integer.parseInt(text));

   context.write(data, new IntWritable(1));

  }

 }

 public static class Reduce extends Reducer<IntWritable, IntWritable, IntWritable, IntWritable>{

  private static IntWritable line_num = new IntWritable(1);

  public void reduce(IntWritable key, Iterable<IntWritable> values, Context context) throws IOException,InterruptedException{

   for(IntWritable val : values){

    context.write(line_num, key);

    line_num = new IntWritable(line_num.get() + 1);

   }

  }

 }

 public static class Partition extends Partitioner<IntWritable, IntWritable>{

  public int getPartition(IntWritable key, IntWritable value, int num_Partition){

   int Maxnumber = 65223;

   int bound = Maxnumber/num_Partition+1;

   int keynumber = key.get();

   for (int i = 0; i<num_Partition; i++){

    if(keynumber<bound * (i+1) && keynumber>=bound * i){

     return i;

    }

   }

   return -1;

  }

 }

 

 public static void main(String[] args) throws Exception{

  Configuration conf = new Configuration();

  conf.set("fs.default.name","hdfs://localhost:9000");

  String[] otherArgs = new String[]{"input","output"};

  if (otherArgs.length != 2) {

   System.err.println("Usage: wordcount <in><out>");

   System.exit(2);

   }

  Job job = Job.getInstance(conf,"Merge and sort");

  job.setJarByClass(MergeSort.class);

  job.setMapperClass(Map.class);

  job.setReducerClass(Reduce.class);

  job.setPartitionerClass(Partition.class);

  job.setOutputKeyClass(IntWritable.class);

  job.setOutputValueClass(IntWritable.class);

  FileInputFormat.addInputPath(job, new Path(otherArgs[0]));

  FileOutputFormat.setOutputPath(job, new Path(otherArgs[1]));

  System.exit(job.waitForCompletion(true) ? 0 : 1);

 }

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值