Sciweavers

800 search results - page 51 / 160
» Understanding Algorithm Performance on an Oversubscribed Sch...
Sort
View
108
Voted
WWW
2006
ACM
16 years 4 months ago
Dynamic placement for clustered web applications
We introduce and evaluate a middleware clustering technology capable of allocating resources to web applications through dynamic application instance placement. We define applicat...
A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike S...
143
Voted
CSCW
2010
ACM
16 years 14 days ago
Catchup: a useful application of time-travel in meetings
People are often required to catch up on information they have missed in meetings, because of lateness or scheduling conflicts. Catching up is a complex cognitive process where pe...
Simon Tucker, Ofer Bergman, Anand Ramamoorthy, Ste...
120
Voted
ESTIMEDIA
2004
Springer
15 years 9 months ago
Data assignment and access scheduling exploration for multi-layer memory architectures
Abstract— This paper presents an exploration framework which performs data assignment and access scheduling exploration for applications given a multilayer memory architecture. O...
Radoslaw Szymanek, Francky Catthoor, Krzysztof Kuc...
118
Voted
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 8 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
RTSS
2008
IEEE
15 years 10 months ago
Task Scheduling for Control Oriented Requirements for Cyber-Physical Systems
The wide applications of cyber-physical systems (CPS) call for effective design strategies that optimize the performance of both computing units and physical plants. We study the ...
Fumin Zhang, Klementyna Szwaykowska, Wayne Wolf, V...