Search Sciweavers | Sciweavers

2432 search results - page 1 / 487

» Using simple abstraction to reinvent computing for paralleli...

click to vote

CACM
2011

84views more CACM 2011»

Using simple abstraction to reinvent computing for parallelism

12 years 12 months ago

Download www.cs.utexas.edu

ple abstraction encapsulating the desired interface between programmers and system builders. Using Simple ion to Reinvent Computing for Parallelism doi:10.1145/1866739.1866757 abst...

Uzi Vishkin

claim paper

Read More »

click to vote

IPPS
2002
IEEE

160views Distributed And Parallel Com...» more IPPS 2002»

Heaps and Stacks in Distributed Shared Memory

13 years 9 months ago

Download www4.in.tum.de

Software-based distributed shared memory (DSM) systems do usually not provide any means to use shared memory regions as stacks or via an efﬁcient heap memory allocator. Instead ...

Markus Pizka, Christian Rehn

claim paper

Read More »

click to vote

IPPS
1998
IEEE

100views Distributed And Parallel Com...» more IPPS 1998»

Random Sampling Techniques in Parallel Computation

13 years 9 months ago

Download ipdps.cc.gatech.edu

Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...

Rajeev Raman

claim paper

Read More »

click to vote

ICDCS
1994
IEEE

105views Distributed And Parallel Com...» more ICDCS 1994»

Using Simple Diffusion to Synchronize the Clocks in a Distributed System

13 years 9 months ago

Download www.cs.drexel.edu

Augusto Ciuffoletti

claim paper

Read More »