Sciweavers

5448 search results - page 544 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
SPAA
2009
ACM
15 years 12 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
COLCOM
2009
IEEE
15 years 10 months ago
VaaS: Videoconference as a service
- Internet is a place nowadays where interoperating services are offered which can be integrated or mashed up in order to fulfill user demands. This paper proposes a way to offer v...
Pedro Rodriguez, Daniel Gallego, Javier Cervino, F...
IPPS
2010
IEEE
15 years 5 months ago
Solving the advection PDE on the cell broadband engine
In this paper we present the venture of porting two different algorithms for solving the two-dimensional advection PDE on the CBE platform, an in-place and an outof-place one, and ...
Georgios Rokos, Gerassimos Peteinatos, Georgia Kou...
SIGMETRICS
2009
ACM
151views Hardware» more  SIGMETRICS 2009»
16 years 1 months ago
MapReduce optimization using regulated dynamic prioritization
We present a system for allocating resources in shared data and compute clusters that improves MapReduce job scheduling in three ways. First, the system uses regulated and user-as...
Thomas Sandholm, Kevin Lai
ICDM
2006
IEEE
154views Data Mining» more  ICDM 2006»
16 years 1 months ago
Mining and Predicting Duplication over Peer-to-Peer Query Streams
Many previous works of data mining user queries in Peer-to-Peer systems focused their attention on the distribution of query contents. However, few has been done towards a better ...
Shicong Meng, Yifeng Shao, Cong Shi, Dingyi Han, Y...