Forum for Science, Industry and Business

Sponsored by:     3M 
Search our Site:

 

Parallel programming may not be so daunting

25.03.2014

'Lock-free' parallel algorithms may match performance of more complex 'wait-free' algorithms

Computer chips have stopped getting faster: The regular performance improvements we've come to expect are now the result of chipmakers' adding more cores, or processing units, to their chips, rather than increasing their clock speed.

In theory, doubling the number of cores doubles the chip's efficiency, but splitting up computations so that they run efficiently in parallel isn't easy. On the other hand, say a trio of computer scientists from MIT, Israel's Technion, and Microsoft Research, neither is it as hard as had been feared.

Commercial software developers writing programs for multicore chips frequently use so-called "lock-free" parallel algorithms, which are relatively easy to generate from standard sequential code. In fact, in many cases the conversion can be done automatically.

Yet lock-free algorithms don't come with very satisfying theoretical guarantees: All they promise is that at least one core will make progress on its computational task in a fixed span of time. But if they don't exceed that standard, they squander all the additional computational power that multiple cores provide.

In recent years, theoretical computer scientists have demonstrated ingenious alternatives called "wait-free" algorithms, which guarantee that all cores will make progress in a fixed span of time. But deriving them from sequential code is extremely complicated, and commercial developers have largely neglected them.

In a paper to be presented at the Association for Computing Machinery's Annual Symposium on the Theory of Computing in May, Nir Shavit, a professor in MIT's Department of Electrical Engineering and Computer Science; his former student Dan Alistarh, who's now at Microsoft Research; and Keren Censor-Hillel of the Technion demonstrate a new analytic technique suggesting that, in a wide range of real-world cases, lock-free algorithms actually give wait-free performance.

"In practice, programmers program as if everything is wait-free," Shavit says. "This is a kind of mystery. What we are exposing in the paper is this little-talked-about intuition that programmers have about how [chip] schedulers work, that they are actually benevolent."

The researchers' key insight was that the chip's performance as a whole could be characterized more simply than the performance of the individual cores. That's because the allocation of different "threads," or chunks of code executed in parallel, is symmetric. "It doesn't matter whether thread 1 is in state A and thread 2 is in state B or if you just swap the states around," says Alistarh, who contributed to the work while at MIT. "What we noticed is that by coalescing symmetric states, you can simplify this a lot."

In a real chip, the allocation of threads to cores is "a complex interplay of latencies and scheduling policies," Alistarh says. In practice, however, the decisions arrived at through that complex interplay end up looking a lot like randomness. So the researchers modeled the scheduling of threads as a process that has at least a little randomness in it: At any time, there's some probability that a new thread will be initiated on any given core.

The researchers found that even with a random scheduler, a wide range of lock-free algorithms offered performance guarantees that were as good as those offered by wait-free algorithms.

That analysis held, no matter how the probability of thread assignment varied from core to core. But the researchers also performed a more specific analysis, asking what would happen when multiple cores were trying to write data to the same location in memory and one of them kept getting there ahead of the others. That's the situation that results in a lock-free algorithm's worst performance, when only one core is making progress.

For that case, they considered a particular set of probabilities, in which every core had the same chance of being assigned a thread at any given time. "This is kind of a worst-case random scheduler," Alistarh says. Even then, however, the number of cores that made progress never dipped below the square root of the number of cores assigned threads, which is still better than the minimum performance guarantee of lock-free algorithms.

###

Additional background

Archive: "Multicore may not be so scary": http://web.mit.edu/newsoffice/2010/multicore-0930.html

Abby Abazorius | EurekAlert!

Further reports about: Computing Engineering MIT Technion Technology decisions individual processing programming randomness technique

More articles from Information Technology:

nachricht LAMA 2.0 accelerates more than just numerical applications
21.06.2016 | Fraunhofer-Institut für Algorithmen und Wissenschaftliches Rechnen SCAI

nachricht Researchers open hairy new chapter in 3-D printing
20.06.2016 | Massachusetts Institute of Technology

All articles from Information Technology >>>

The most recent press releases about innovation >>>

Die letzten 5 Focus-News des innovations-reports im Überblick:

Im Focus: First experimental quantum simulation of particle physics phenomena

Physicists in Innsbruck have realized the first quantum simulation of lattice gauge theories, building a bridge between high-energy theory and atomic physics. In the journal Nature, Rainer Blatt‘s and Peter Zoller’s research teams describe how they simulated the creation of elementary particle pairs out of the vacuum by using a quantum computer.

Elementary particles are the fundamental buildings blocks of matter, and their properties are described by the Standard Model of particle physics. The...

Im Focus: Is There Life On Mars?

Survivalist back from Space - 18 months on the outer skin of the ISS

A year and a half on the outer wall of the International Space Station ISS in altitude of 400 kilometers is a real challenge. Whether a primordial bacterium...

Im Focus: CWRU physicists deploy magnetic vortex to control electron spin

Potential technology for quantum computing, keener sensors

Researchers at Case Western Reserve University have developed a way to swiftly and precisely control electron spins at room temperature.

Im Focus: Physicists measured something new in the radioactive decay of neutrons

The experiment inspired theorists; future ones could reveal new physics

A physics experiment performed at the National Institute of Standards and Technology (NIST) has enhanced scientists' understanding of how free neutrons decay...

Im Focus: Discovery of gold nanocluster 'double' hints at other shape changing particles

New analysis approach brings two unique atomic structures into focus

Chemically the same, graphite and diamonds are as physically distinct as two minerals can be, one opaque and soft, the other translucent and hard. What makes...

All Focus news of the innovation-report >>>

Anzeige

Anzeige

Event News

ERES 2016: The largest conference in the European real estate industry

09.06.2016 | Event News

Networking 4.0: International Laser Technology Congress AKL’16 Shows New Ways of Cooperations

24.05.2016 | Event News

Challenges of rural labor markets

20.05.2016 | Event News

 
Latest News

Nanoscientists develop the 'ultimate discovery tool'

24.06.2016 | Materials Sciences

Russian physicists create a high-precision 'quantum ruler'

24.06.2016 | Physics and Astronomy

Hubble confirms new dark spot on Neptune

24.06.2016 | Physics and Astronomy

VideoLinks
B2B-VideoLinks
More VideoLinks >>>