Sciweavers

1129 search results - page 145 / 226
» From programming to modeling: our experience with a distribu...
Sort
View
PPOPP
2009
ACM
14 years 9 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
PLDI
2010
ACM
14 years 2 months ago
Green: a framework for supporting energy-conscious programming using controlled approximation
Energy-efficient computing is important in several systems ranging from embedded devices to large scale data centers. Several application domains offer the opportunity to tradeof...
Woongki Baek, Trishul M. Chilimbi
HIPC
2007
Springer
14 years 24 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
HICSS
2005
IEEE
125views Biometrics» more  HICSS 2005»
14 years 2 months ago
Taking Topic Detection From Evaluation to Practice
Abstract— The Topic Detection and Tracking (TDT) research community investigates information retrieval methods for organizing a constantly arriving stream of news articles by the...
James Allan, Stephen M. Harding, David Fisher, Alv...
ISORC
2009
IEEE
14 years 3 months ago
Component Based Middleware-Synthesis for AUTOSAR Basic Software
Distributed real-time automotive embedded systems have to be highly dependable as well as cost-efficient due to the large number of manufactured units. To close the gap between r...
Dietmar Schreiner, Markus Schordan, Karl M. Gö...