Sciweavers

347 search results - page 1 / 70
» Scheduling in mapreduce-like systems for fast completion tim...
Sort
View
INFOCOM
2011
IEEE
12 years 8 months ago
Scheduling in mapreduce-like systems for fast completion time
Abstract—Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important p...
Hyunseok Chang, Murali S. Kodialam, Ramana Rao Kom...
RTAS
2010
IEEE
13 years 2 months ago
DARTS: Techniques and Tools for Predictably Fast Memory Using Integrated Data Allocation and Real-Time Task Scheduling
—Hardware-managed caches introduce large amounts of timing variability, complicating real-time system design. One alternative is a memory system with scratchpad memories which im...
Sangyeol Kang, Alexander G. Dean
VLSID
2006
IEEE
143views VLSI» more  VLSID 2006»
13 years 10 months ago
Frame Based Fair Multiprocessor Scheduler: A Fast Fair Algorithm for Real-Time Embedded Systems
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...
Arnab Sarkar, P. P. Chakrabarti, Rajeev Kumar
TPDS
1998
124views more  TPDS 1998»
13 years 4 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
ADAEUROPE
2008
Springer
13 years 11 months ago
Fast Scheduling of Distributable Real-Time Threads with Assured End-to-End Timeliness
We consider networked, embedded real-time systems that operate under run-time uncertainties on activity execution times and arrivals, node failures, and message losses. We consider...
Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Je...