Spark source code: new stage in DAGScheduler












0














I am reading the source code of DAGScheduler from Spark's 0.5 branch.



The newStage method:



  def newStage(rdd: RDD[_], shuffleDep: Option[ShuffleDependency[_,_,_]]): Stage = {
cacheTracker.registerRDD(rdd.id, rdd.splits.size)
...
val id = nextStageId.getAndIncrement()
val stage = new Stage(id, rdd, shuffleDep, getParentStages(rdd))
...
}


Firstly, it calls registerRDD to register the rdd, and is actually stored as a Hashset.



Secondly, it crates a new Stage.
Inside the getParentStages, it will return the parents dependencies of the rdd, but it will also always register this rdd again in addition to its parents.



The basic logic (pseudocode) of getParentStages is:



def visit(rdd) {
if (rdd not visited) {
set rdd visited;
registerRDD(rdd);
for (each dep in rdd.dependencies) {
visit(dep.rdd)
}
}
}
visit(rdd)


In my view, since this rdd will be registered in getParentStages anyway, is it necessary to register it in newStage method?



Of course, since the underlying data structure is a HashSet, nothing will happen when registering again.










share|improve this question





























    0














    I am reading the source code of DAGScheduler from Spark's 0.5 branch.



    The newStage method:



      def newStage(rdd: RDD[_], shuffleDep: Option[ShuffleDependency[_,_,_]]): Stage = {
    cacheTracker.registerRDD(rdd.id, rdd.splits.size)
    ...
    val id = nextStageId.getAndIncrement()
    val stage = new Stage(id, rdd, shuffleDep, getParentStages(rdd))
    ...
    }


    Firstly, it calls registerRDD to register the rdd, and is actually stored as a Hashset.



    Secondly, it crates a new Stage.
    Inside the getParentStages, it will return the parents dependencies of the rdd, but it will also always register this rdd again in addition to its parents.



    The basic logic (pseudocode) of getParentStages is:



    def visit(rdd) {
    if (rdd not visited) {
    set rdd visited;
    registerRDD(rdd);
    for (each dep in rdd.dependencies) {
    visit(dep.rdd)
    }
    }
    }
    visit(rdd)


    In my view, since this rdd will be registered in getParentStages anyway, is it necessary to register it in newStage method?



    Of course, since the underlying data structure is a HashSet, nothing will happen when registering again.










    share|improve this question



























      0












      0








      0







      I am reading the source code of DAGScheduler from Spark's 0.5 branch.



      The newStage method:



        def newStage(rdd: RDD[_], shuffleDep: Option[ShuffleDependency[_,_,_]]): Stage = {
      cacheTracker.registerRDD(rdd.id, rdd.splits.size)
      ...
      val id = nextStageId.getAndIncrement()
      val stage = new Stage(id, rdd, shuffleDep, getParentStages(rdd))
      ...
      }


      Firstly, it calls registerRDD to register the rdd, and is actually stored as a Hashset.



      Secondly, it crates a new Stage.
      Inside the getParentStages, it will return the parents dependencies of the rdd, but it will also always register this rdd again in addition to its parents.



      The basic logic (pseudocode) of getParentStages is:



      def visit(rdd) {
      if (rdd not visited) {
      set rdd visited;
      registerRDD(rdd);
      for (each dep in rdd.dependencies) {
      visit(dep.rdd)
      }
      }
      }
      visit(rdd)


      In my view, since this rdd will be registered in getParentStages anyway, is it necessary to register it in newStage method?



      Of course, since the underlying data structure is a HashSet, nothing will happen when registering again.










      share|improve this question















      I am reading the source code of DAGScheduler from Spark's 0.5 branch.



      The newStage method:



        def newStage(rdd: RDD[_], shuffleDep: Option[ShuffleDependency[_,_,_]]): Stage = {
      cacheTracker.registerRDD(rdd.id, rdd.splits.size)
      ...
      val id = nextStageId.getAndIncrement()
      val stage = new Stage(id, rdd, shuffleDep, getParentStages(rdd))
      ...
      }


      Firstly, it calls registerRDD to register the rdd, and is actually stored as a Hashset.



      Secondly, it crates a new Stage.
      Inside the getParentStages, it will return the parents dependencies of the rdd, but it will also always register this rdd again in addition to its parents.



      The basic logic (pseudocode) of getParentStages is:



      def visit(rdd) {
      if (rdd not visited) {
      set rdd visited;
      registerRDD(rdd);
      for (each dep in rdd.dependencies) {
      visit(dep.rdd)
      }
      }
      }
      visit(rdd)


      In my view, since this rdd will be registered in getParentStages anyway, is it necessary to register it in newStage method?



      Of course, since the underlying data structure is a HashSet, nothing will happen when registering again.







      scala apache-spark






      share|improve this question















      share|improve this question













      share|improve this question




      share|improve this question








      edited Nov 23 at 7:51

























      asked Nov 23 at 7:35









      chenzhongpu

      2,24232451




      2,24232451





























          active

          oldest

          votes











          Your Answer






          StackExchange.ifUsing("editor", function () {
          StackExchange.using("externalEditor", function () {
          StackExchange.using("snippets", function () {
          StackExchange.snippets.init();
          });
          });
          }, "code-snippets");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "1"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53442416%2fspark-source-code-new-stage-in-dagscheduler%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown






























          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Stack Overflow!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          To learn more, see our tips on writing great answers.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53442416%2fspark-source-code-new-stage-in-dagscheduler%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          A CLEAN and SIMPLE way to add appendices to Table of Contents and bookmarks

          Calculate evaluation metrics using cross_val_predict sklearn

          Insert data from modal to MySQL (multiple modal on website)