MIT Creates Algorithm That Speeds Up Page Load Time By 34% (softpedia.com)

An anonymous reader writes: MIT researchers have created an algorithm that analyzes web pages and creates dependency graphs for all network resources that need to be loaded (CSS, JS, images, etc.). The algorithm, called Polaris, will be presented this week at the USENIX Symposium on Networked Systems Design and Implementation conference, and is said to be able to cut down page load times by 34%, on average. The larger and more resources a web page contains, the better the algorithm's efficiency gets -- which should be useful on today's JavaScript-heavy sites.

Comments

So fast

[SeaFox]

I got first post!

Re:So fast

[davester666]

In other news, most websites announced they are upgrading to new larger graphics and javascript libraries, as a necessary first step in ensuring their pages don't load too fast.

Now the next step

[Anonymous Coward]

Now, the next logical step is to have this algorithm analyze the actual scripts and figure out a way to convince the various malwares that they've been loaded satisfactorily even though they haven't. That way you could avoid downloading almost 99% of modern web pages.

Re:Is it called ad block plus?

[c0d3g33k]

And nothing of value was lost.

Re:Reading TFA

[johannesg]

> I went and actually read TFA

Thank you brother. Your sacrifice is appreciated by all.

Re:Reading TFA

[Anonymous Coward]

I went and actually read TFA. It seems all they've done is create a bastardized version of a less efficient SPDY/HTTP2 protocol fetching system. Essentially, they're trying to solve a problem that is already solved, but the existing solution is already faster, more efficient, and more well thought out in general.

When they get their degrees from MIT, they're already well-prepared to go to work on systemd.