mantej-singh/apache-spark-under-the-hood--wordcount

Running my first pyspark app in CDH5

PySpark- WordCount, under the hood!

Running my first pyspark app in CDH5.

Spark has many key components in the Spark infrastructure, but there are a few basics that are covered here. These are partitioning, caching, serialization, and the shuffle operation.

---

PySpark Job in Spark UI

Since Spark follows Lazy Evaluation it creates a single action job in the end. It waits until an action is called.

Details for 1st Job

So this Job was further divided into two stages, one for Stage0: reduceByKey and the other for Stage1: collect(our last code). We used reduceByKey in it,so in future try to minimize the number of shuffles and the amount of data shuffled. Shuffles are expensive operations; all shuffle data must be written to disk and then transferred over the network.

DAG for Stage1: Collect

This clearly show a PythonRDD object is a scala object under the hood. It reads/takes the 2.1 KB of shuffled data, map it together and returns a RDD.

---

---

Method 2:

Using .reduceByKey(add) instead of .reduceByKey(lambda w1,w2: w1 + w2)

from operator import add

count=myfile.flatMap(lambda line: line.split(" ")).map(lambda word: (word,1)).reduceByKey(add)

count.collect()

Later I tried to run it multiple times, with duration reducing in each run:

What if I skip the reduceByKey() and jump on to collect()

It will skip the reducing part from DAG and read the shuffled data and displays output

---

---

Method 3: reduceByKey VS groupByKey

reduceByKey()

count_reduceByKey=myfile.flatMap(lambda line: line.split(" ")).map(lambda word: (word,1)).reduceByKey(lambda w1,w2: w1 + w2)

count_reduceByKey.collect()

How it works:

VS

groupByKey()

count_groupByKey=myfile.flatMap(lambda line: line.split(" ")).map(lambda word: (word,1)).groupByKey().map(lambda (word,count): (word,sum(count)))

count_groupByKey.collect()

How it works:

Comparing their performance, under the hood:

In Saprk UI under the Stages tab you can chekc the read/write performed by our job.

• This Job is divided in to two Stages
• Stage0 for groupByKey()
• Stage1 for collect()
• They both shuffled 2.5 KB ko data, as compared to reduceBYKey() 2.1 KB

---

Topic 4: Sorting then Filtering VS Filtering then Sorting:

Sorting then Filtering

textbook=sc.textFile('hdfs://devtoolsRnD/data/everyone/work/hive/SparkCookbook.txt')

textbook.flatMap(lambda line: line.split(" ")).map(lambda word: (word,1)).reduceByKey(add).sortBy(lambda x: (x[1]),ascending=False).filter(lambda x:x[1]>600).collect()

[('the', 2516), ('to', 1157), ('a', 928), ('is', 896), ('of', 895), ('and', 782), ('in', 624)]

Less Shuffle

VS

Filtering then Sorting

textbook.flatMap(lambda line: line.split(" ")).map(lambda word: (word,1)).reduceByKey(add).filter(lambda x:x[1]>600).sortBy(lambda x: (x[1]),ascending=False).collect()

More Shuffle

---

Topic 5: RDD Persistence: Serialized Caching vs Deserialized Caching:

Serialized Caching

myfile.cache()

OR

myfile.persist(StorageLevel.MEMORY_AND_DISK_SER)

Store RDD as serialized Java objects (one byte array per partition). This is generally more space-efficient than deserialized objects, especially when using a fast serializer, but more CPU-intensive to read. but spill partitions that don't fit in memory to disk instead of recomputing them on the fly each time they're needed.

Deserialized Caching

myfile.persist(StorageLevel.MEMORY_AND_DISK)

Store RDD as deserialized Java objects in the JVM. If the RDD does not fit in memory, store the partitions that don't fit on disk, and read them from there when they're needed

Topic 5: Data Locality

Spark is a framework which lets user to create parallel data processing code and then distribute that code across a cluster of machines, which means it will execute tasks as close to where the data lives as possible (i.e. minimize data transfer).

Eg: Push down predicates.

You can also check for Data Locality level, my observation was: for reduceByKey & groupByKey it was set at NODE_LOCAL and when I did collect() it was PROCESS_LOCAL

---

---

---

References:

1. A good defination for flatMap I found on Stackoverflow

2. reduceByKey VS groupByKey Databricks

3. For Kerberos TGT kinit this!

4. Spark Framework:

5. Helpful Youtube video: