Sciweavers

1095 search results - page 126 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
AUSAI
2003
Springer
15 years 3 months ago
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
Yudho Giri Sucahyo, Raj P. Gopalan, Amit Rudra
INFOCOM
2006
IEEE
15 years 4 months ago
Optimal Energy and Delay Tradeoffs for Multi-User Wireless Downlinks
— We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly varying channels. First, we extend the BerryGallag...
Michael J. Neely
PODC
2005
ACM
15 years 3 months ago
Stochastic analysis of distributed deadlock scheduling
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
Shigang Chen, Yibei Ling
ICDE
2011
IEEE
265views Database» more  ICDE 2011»
14 years 1 months ago
RAFTing MapReduce: Fast recovery on the RAFT
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...
Jorge-Arnulfo Quiané-Ruiz, Christoph Pinkel...
TMC
2010
141views more  TMC 2010»
14 years 8 months ago
Energy-Optimal Scheduling with Dynamic Channel Acquisition in Wireless Downlinks
—We consider a wireless base station serving L users through L time-varying channels. It is well known that opportunistic scheduling algorithms with full channel state informatio...
Chih-Ping Li, Michael J. Neely