Hello,

We noticed you're browsing in private or incognito mode.

To continue reading this article, please exit incognito mode or log in.

Not an Insider? Subscribe now for unlimited access to online articles.

Leslie Lamport ’60

Turing winner loves to solve practical problems.

The first computer that Leslie Lamport encountered in his first year at MIT was an IBM 704. The summer before, he had learned how to mount and switch external storage memory tapes on such a machine in a part-time job at Con Edison in New York. “In my spare time, I learned to program the computer and made some little programs,” he recalls.

Leslie Lamport ’60

Lamport graduated from MIT in three years with a degree in mathematics, and then he earned two more math degrees: a master’s in 1963 and a PhD in 1972, both at Brandeis University. He built a career in computer science at Compass, SRI International, Digital Equipment, and Microsoft. This June, the Association for Computing Machinery bestowed on Lamport computing’s top prize, the Turing Award. It came with a $250,000 check.

MIT News cover
This story is part of the September/October 2014 Issue of the MIT News magazine
See the rest of the issue
Subscribe

As was clear in those early experiences, Lamport always sought to roll up his sleeves and assess computers’ practical, everyday problems.

In seminal work published in 1978, Lamport set out many of the key concepts in distributed computing, which laid the groundwork for the systems that enable computers to work together across space and time, despite occasional failure. Algorithms and protocols he developed—including logical clocks, which capture chronological and causal relationships in a distributed system, and the fault tolerance protocol known as Paxos—would help make the World Wide Web possible. Today, technologies ranging from search engines to 911 call centers to air traffic control systems rely on his breakthroughs.

Lamport, who lives with his wife in Palo Alto, California, is humble about his work.

“I’ve been credited with initiating the theory of distributed systems and I feel embarrassed by that, because I don’t see a theory there,” he says. “There’s nothing there like Newtonian mechanics or relativity, something in the science sense you’d call a theory. But in looking at all these little pieces of work I’ve done, although I didn’t create a theory, I did, with the help of others, create a path that other people have since followed—and turned into a superhighway.”

Lamport still dreams of an underlying theory that would tie together all his work on the way simultaneous processes affect one another in computer systems. But on a typical day, he’s more intent on encouraging engineers to employ the algorithms and tools he’s developing at Microsoft Research in Palo Alto.

“It’s a great lab, with great colleagues, and a great company that really appreciates research,” he says.

The feeling is mutual.

“Leslie has done great things not just for the field of computer science, but also in helping make the world a safer place,” Microsoft founder Bill Gates said in a Microsoft tribute. “Countless people around the world benefit from his work without ever hearing his name.”

AI is here.
Own what happens next at EmTech Digital 2019.

Register now
Next in MIT News
Want more award-winning journalism? Subscribe to Insider Plus.
  • Insider Plus {! insider.prices.plus !}*

    {! insider.display.menuOptionsLabel !}

    Everything included in Insider Basic, plus the digital magazine, extensive archive, ad-free web experience, and discounts to partner offerings and MIT Technology Review events.

    See details+

    Print + Digital Magazine (6 bi-monthly issues)

    Unlimited online access including all articles, multimedia, and more

    The Download newsletter with top tech stories delivered daily to your inbox

    Technology Review PDF magazine archive, including articles, images, and covers dating back to 1899

    10% Discount to MIT Technology Review events and MIT Press

    Ad-free website experience

/3
You've read of three free articles this month. for unlimited online access. You've read of three free articles this month. for unlimited online access. This is your last free article this month. for unlimited online access. You've read all your free articles this month. for unlimited online access. You've read of three free articles this month. for more, or for unlimited online access. for two more free articles, or for unlimited online access.