Sciweavers

3600 search results - page 25 / 720
» The settling-time reducibility ordering
Sort
View
ECIS
2003
13 years 9 months ago
Strategies to reduce information asymmetry in web service market
The web service model provides fundamental advantages compared to the classical software usage model. But transactions in the web service market have by far not reached the expect...
Gerrit Tamm, Maria Wünsche
ICDE
2001
IEEE
121views Database» more  ICDE 2001»
14 years 9 months ago
Integrating Semi-Join-Reducers into State of the Art Query Processors
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
Konrad Stocker, Donald Kossmann, Reinhard Braumand...
IEEEPACT
2008
IEEE
14 years 2 months ago
Mars: a MapReduce framework on graphics processors
We design and implement Mars, a MapReduce framework, on graphics processors (GPUs). MapReduce is a distributed programming framework originally proposed by Google for the ease of ...
Bingsheng He, Wenbin Fang, Qiong Luo, Naga K. Govi...
LICS
1997
IEEE
13 years 11 months ago
Ground Reducibility is EXPTIME-Complete
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
Hubert Comon, Florent Jacquemard
NOMS
2010
IEEE
180views Communications» more  NOMS 2010»
13 years 6 months ago
Performance-driven task co-scheduling for MapReduce environments
—MapReduce is a data-driven programming model proposed by Google in 2004 which is especially well suited for distributed data analytics applications. We consider the management o...
Jorda Polo, David Carrera, Yolanda Becerra, Malgor...