Provide an example of a distributed computation that would be difficult to implement in MapReduce, giving full reasons for your answer.
What will be an ideal response?
MapReduce is designed to work well with applications that fit the pattern of taking large datasets, performing the same operation (the map operation) on different chunks of this data, producing a set of intermediary results, sorting these intermediary results (by intermediary key), then combining these intermediary results into a single value or values, again by carrying out a number of parallel executions of the same operation (the reduce operation). This is a flexible paradigm that matches many styles of distributed computation, but not all.
Consider for example a computation that follows a pipeline pattern where the results of one computation feed directly into another and so on, along a pipeline (for example as in the class Sieve of Eratosthenes algorithm). This is fundamentally a different programming pattern that would not work well in MapReduce. There are many other examples of distributed computation that do not fall into the pattern supported by MapReduce.
You might also like to view...
By default, the tabs on a JTabbedPane appear at the:
a. top. b. bottom. c. left. d. right.
You are a network administrator, and you are bringing up a new FTP server in the company's domain. What must you ensure happens as far as DNS is concerned?
What will be an ideal response?
What is the purpose of a CSIRT?
A. Respond to severe weather incidents with impacts that are too large for the on-duty IT staff to handle. B. Configure firewalls and routers. C. Respond to severe computer security incidents with impacts that are too small for the on-duty IT staff to handle. D. Respond to severe computer security incidents with impacts that are too large for the on-duty IT staff to handle.
You use the pinch/split interaction when you want to scroll through a page.
Answer the following statement true (T) or false (F)