Sciweavers

Share
ICDE
2011
IEEE
258views Database» more  ICDE 2011»
8 years 29 days ago
SystemML: Declarative machine learning on MapReduce
Abstract—MapReduce is emerging as a generic parallel programming paradigm for large clusters of machines. This trend combined with the growing need to run machine learning (ML) a...
Amol Ghoting, Rajasekar Krishnamurthy, Edwin P. D....
CORR
2011
Springer
180views Education» more  CORR 2011»
8 years 1 months ago
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
Lisa Fleischer, Zhenghui Wang
TCS
2010
8 years 4 months ago
Maximizing the minimum load for selfish agents
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...
Leah Epstein, Rob van Stee
EMNLP
2009
8 years 7 months ago
Reverse Engineering of Tree Kernel Feature Spaces
We present a framework to extract the most important features (tree fragments) from a Tree Kernel (TK) space according to their importance in the target kernelbased machine, e.g. ...
Daniele Pighin, Alessandro Moschitti
IPPS
2010
IEEE
8 years 7 months ago
Varying bandwidth resource allocation problem with bag constraints
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
IPPS
2010
IEEE
8 years 7 months ago
Characterizing heterogeneous computing environments using singular value decomposition
We consider a heterogeneous computing environment that consists of a collection of machines and task types. The machines vary in capabilities and different task types are better su...
Abdulla Al-Qawasmeh, Anthony A. Maciejewski, Howar...
ICPADS
2010
IEEE
8 years 7 months ago
Data-Aware Task Scheduling on Multi-accelerator Based Platforms
To fully tap into the potential of heterogeneous machines composed of multicore processors and multiple accelerators, simple offloading approaches in which the main trunk of the ap...
Cédric Augonnet, Jérôme Clet-O...
FSTTCS
2010
Springer
8 years 7 months ago
Minimizing Busy Time in Multiple Machine Real-time Scheduling
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, ...
JCO
2010
99views more  JCO 2010»
8 years 7 months ago
Online scheduling with a buffer on related machines
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
György Dósa, Leah Epstein
MP
2007
145views more  MP 2007»
8 years 8 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
books