Differences between revisions 32 and 33
Revision 32 as of 2010-06-21 19:38:14
Size: 5220
Editor: Pradeepkumar
Comment:
Revision 33 as of 2010-06-21 19:40:49
Size: 5230
Editor: Pradeepkumar
Comment:
Deletions are marked like this. Additions are marked like this.
Line 23: Line 23:
  . --> O(1) seeks to create any revision.   . * O(1) seeks to create any revision.
Line 26: Line 26:
  . --> An intelligent algorithm to reduce number of seeks to reconstruct any revision.I think constructing revision is not straight forward as it is now. It's not going to be linear.Right now constructing a revision is simply applaying each block of data to a base till the revision required.   . * An intelligent algorithm to reduce number of seeks to reconstruct any revision.I think constructing revision is not straight forward as it is now. It's not going to be linear.Right now constructing a revision is simply applaying each block of data to a base till the revision required.
Line 28: Line 28:
 . --> Investigation about merge revision.At merge revision node has two parents, delta should be taken against first or
 . --> Optimization, and investigation for better implementation(If possible).
 .         * Investigation about merge revision.At merge revision node has two parents, delta should be taken against first or
 .         * Optimization, and investigation for better implementation(If possible).
Line 35: Line 35:
  . --> Backward compatability matrix (by tonfa): http://mercurial.selenic.com/wiki/ParentDeltaPlan   . * Backward compatability matrix (by tonfa): http://mercurial.selenic.com/wiki/ParentDeltaPlan
Line 61: Line 61:
  . --> An intelligent algorithm to reduce number of seeks to reconstruct any revision.I think constructing revision is not straight forward as it is now. It's not going to be linear.   . * An intelligent algorithm to reduce number of seeks to reconstruct any revision.I think constructing revision is not straight forward as it is now. It's not going to be linear.
Line 64: Line 64:
 . --> Investigation about merge revision. --> Optimization, and investigation for better implementation(If possible).
  . --> Continuous parallel testing.
 .         * Investigation about merge revision.
. * Optimization, and investigation for better implementation(If possible).
  . * Continuous parallel testing.
Line 72: Line 73:
  . --> Implementation of changes according to old, new servers,client, repos.
   . >> Backward compatibility matrix (by tonfa): http://mercurial.selenic.com/wiki/ParentDeltaPlan .
  . * Implementation of changes according to old, new servers,client, repos.
   . ** Backward compatibility matrix (by tonfa): http://mercurial.selenic.com/wiki/ParentDeltaPlan .
Line 76: Line 77:
  . [(I will start testing shortly after mid-term evaluation, i.e., around 18th-July, would take a week to complete)]
  * Integrating with other's work.
   
. [ ( Remaining time, depending upon other students)]
  . * [(I will start testing shortly after mid-term evaluation, i.e., around 18th-July, would take a week to complete)]
  * * Integrating with other's work. [ ( Remaining time, depending upon other students)]
Line 92: Line 92:

Google Summer of Code-2010

I am interested in "Parent delta". I can also work on conversion tools. But I am mainly focusing on Parent Delta Plan.

A word about project:

Mercurial calculates diffs against previous revision rather than parent. In some cases this implementation is space inefficient, and it is more sensible to store deltas against parent. This project is about implementing Parent Delta Plan. This implementation changes the structure of revlogs, so wire protocol has to be extended to allow backward compatibility.

============================================================================

Proposal

TO DO(Tentative): Major:

  • Changes in revlog
  • Changes in wire protocol

Changes in revlog:

  • Change revlog structure, now it appends the next delta to existing data.This helps in reconstrfucting a revision at O(1) seeks. If

parent delta is implemented better compression can be achieved but, may have to compromise with number of seeks.

  • Current:Linear delta model

    • * O(1) seeks to create any revision.
  • Parent delta model
    • ** I think this can be completed quickly, tonfa shared patches for this***
    • * An intelligent algorithm to reduce number of seeks to reconstruct any revision.I think constructing revision is not straight forward as it is now. It's not going to be linear.Right now constructing a revision is simply applaying each block of data to a base till the revision required.
  • * Investigation about merge revision.At merge revision node has two parents, delta should be taken against first or
  • * Optimization, and investigation for better implementation(If possible).

Changes in wire protocol:

  • Changes in wire protocol to allow backward computability.
  • Implementation of changes according to old, new servers,client, repos.
  • Rigorous testing
  • Integrating with other's work.(Changeset discovery, Lightweight copies/renames)

About Me:

  • I am student at Indian Institute of Technology, Roorkee. I am currently pursing third year of 5 years degree, Mathematics as major. I am a Linux enthusiast. Interested in open source. I have been learning C,Python. Some of my projects can be found on github ( http://www.github.com/in3Xes ). I have never got opportunity to contribute to open source. GSoC would be stepping stone for that.

  • I am project leader in IMG ( Information Management Group, IIT Roorkee, http://www.iitr.ac.in/IMG/ ), a group which manages intranet, student databases, institute website. I have worked on PHP, Java in web development.

Contact Information:

  • Name: Pradeepkumar Gayam

    Email: in3xes@gmail.com

  • IRC Nick: in3xes (freenode.net)
  • Jabber ID: in3xes [AT] gmail.com (talk.google.com)

Schedule:

  • I would start coding well before the schedule given in the time line. My final exams will end by May-15th. I can start working rigorously shortly after exams. Till May-15th(or 24th according to time line) I will be reading code, documentation, getting used to coding style, getting ready to start coding, little experimentation etc.

Timeline

Changes in revlog structure: [Total 3 weeks]

  • Parent delta model:
    • * An intelligent algorithm to reduce number of seeks to reconstruct any revision.I think constructing revision is not straight forward as it is now. It's not going to be linear.
  • [(It can take 1 1/2 to 2 weeks to bring it to working stage, Roughly around 5th-Jun)]
  • * Investigation about merge revision.
  • * Optimization, and investigation for better implementation(If possible).
    • * Continuous parallel testing.
      • [( I would finish testing and other work nearly in 10 days, by 15th-Jun)]

Changes in wire protocol:[Total 3 to 3 1/2 weeks]

  • Changes in wire protocol to allow backward computability.
    • [(For midterm evaluation, this may not be complete, but significant part of it)]
    • * Implementation of changes according to old, new servers,client, repos.
  • Rigorous testing.
    • * [(I will start testing shortly after mid-term evaluation, i.e., around 18th-July, would take a week to complete)]
    • * Integrating with other's work. [ ( Remaining time, depending upon other students)]

Link to my GSoC application on bitbucket.org

Work Progess:

Couple for things that are related to revlog

1) A script by tonfa, proof for parent delta.

2) mpm explaining how space inefficiency is caused.

3) A python script to shrink revlog by sorting topological order in mercurial repo.

CategoryHomepage

Pradeepkumar (last edited 2010-10-22 18:17:21 by mpm)