Results 1 to 2 of 2
  1. #1
    shogun1234 is offline Member
    Join Date
    Feb 2010
    Posts
    1
    Rep Power
    0

    Default Newbie distributed computing question

    I am interested in distributed computing but new to this field. Now I have a question regarding to this field. My question is `how can I programm to compute and find the occurrence of a great deal of integers?' For instance, suppose there 1m integers, in which there are several integer which may repeat, e.g., ... 2, 2, .... 999 ... 999 ...; therefore, what I would like to do is to
    count how many times those integers occur.

    I understand there has some frameworks, e.g., Hadoop, which can help to deal with such kind of task. But what I would like is to go through some explain and learn some important issues related to distributed computing through a simple example.

    Is there any example/ tutorial that may have such kind of explain? Or any resource/book may talk about this?

    I appreciate any suggestion.

    Thank you very much.

  2. #2
    JosAH's Avatar
    JosAH is offline Moderator
    Join Date
    Sep 2008
    Location
    Voorschoten, the Netherlands
    Posts
    13,730
    Blog Entries
    7
    Rep Power
    21

    Default

    Quote Originally Posted by shogun1234 View Post
    I am interested in distributed computing but new to this field. Now I have a question regarding to this field. My question is `how can I programm to compute and find the occurrence of a great deal of integers?' For instance, suppose there 1m integers, in which there are several integer which may repeat, e.g., ... 2, 2, .... 999 ... 999 ...; therefore, what I would like to do is to
    count how many times those integers occur.

    I understand there has some frameworks, e.g., Hadoop, which can help to deal with such kind of task. But what I would like is to go through some explain and learn some important issues related to distributed computing through a simple example.

    Is there any example/ tutorial that may have such kind of explain? Or any resource/book may talk about this?

    I appreciate any suggestion.

    Thank you very much.
    The classical MPI type of approach (MPI == Message Passing Interface, a distributed computing system) is as follows: given a (long) list of numbers n1, n2, n3 ..., assume the list is sorted; chop up the list so that the chunks are completely disjunct from each other; distribute the chunks to the 'other' machines in the cluster and let them do their job. Finally collect all the statistics.

    If the list is not sorted you can do the same but then you have to do some post processing on all the results because those chunks might not have been disjunct.

    kind regards,

    Jos

Similar Threads

  1. HROM-JI: A new distributed computing java framework
    By dicromo in forum Java Software
    Replies: 0
    Last Post: 01-19-2010, 03:50 PM
  2. newbie question
    By ronguilmet in forum New To Java
    Replies: 2
    Last Post: 11-16-2009, 03:37 AM
  3. Newbie question; Vectors
    By Kern in forum New To Java
    Replies: 7
    Last Post: 08-03-2008, 07:59 AM
  4. distributed computing in java
    By pushpik in forum Advanced Java
    Replies: 0
    Last Post: 03-31-2008, 07:50 PM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •