Publications related to Scheduling with Multiprocessors: A rounding network algorithm with a constant error

Scalable scheduling of energy control systems

Peak power consumption is a universal problem across energy control systems in electrical grids, buildings, and industrial automation where the uncoordinated operation of multiple controllers result in temporally correlated electricity demand surges (or pe ...

IEEE Press2015

An Ultra-Low-Power Application-Specific Processor with Sub-VT Memories for Compressed Sensing

David Atienza Alonso, Andreas Peter Burg, Pascal Andreas Meinerzhagen, Jeremy Hugues-Felix Constantin, Ahmed Yasir Dogan, Oskar Andersson

Compressed sensing (CS) is a universal low-complexity data compression technique for signals that have a sparse representation in some domain. While CS data compression can be done both in the analog- and digital domain, digital implementations are often u ...

Springer2013

Energy-Aware Processing Platform Exploration for Embedded Biosignal Analysis

Ahmed Yasir Dogan

According to the World Health Organization, lifestyle-related diseases, e.g., cardiovascular diseases are the major cause of mortality worldwide. An accurate and continuous medical supervision is highly required for diagnosis and treatment of such diseases ...

EPFL2013

Greedy Scheduling for Distributed Computing Clusters

Amin Karbasi, Milan Vojnovic

Allocating tasks to machines in computing clusters is described. In an embodiment a set of tasks associated with a job are received at a scheduler. In an embodiment an index can be computed for each combination of tasks and processors and stored in a looku ...

2011

A Tighter Analysis of Work Stealing

Nicolas Gabriel Gast, Denis Trystram

Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost for managing a single centralized list becomes prohibitive. The objective of this wor ...

Springer Berlin Heidelberg2010

An Improved LP-based Approximation for Steiner Tree

Thomas Rothvoss, Laura Sanità

The Steiner tree problem is one of the most fundamental

\mathbf{NP}

-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for thi ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2010

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

Dominique de Werra

We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of processors is partitioned into processor groups. We show that the makespan minimization problem is polynomially solvable for two multiprocessor groups even ...

2010

A hardware-software codesign framework for cellular computing

Pierre-André Mudry

Until recently, the ever-increasing demand of computing power has been met on one hand by increasing the operating frequency of processors and on the other hand by designing architectures capable of exploiting parallelism at the instruction level through h ...

EPFL2009

Multiple Object Tracking using Flow Linear Programming

Pascal Fua, François Fleuret, Jérôme Berclaz

Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in previ ...

2009

Multiple Object Tracking using Flow Linear Programming

Pascal Fua, François Fleuret, Jérôme Berclaz

Multi-object tracking can be achieved by detecting objects in individ- ual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in pre ...

Idiap2009

Scheduling with Multiprocessors: A rounding network algorithm with a constant error

Graph Chatbot

Chat with Graph Search

Scalable scheduling of energy control systems

An Ultra-Low-Power Application-Specific Processor with Sub-VT Memories for Compressed Sensing

Energy-Aware Processing Platform Exploration for Embedded Biosignal Analysis

Greedy Scheduling for Distributed Computing Clusters

A Tighter Analysis of Work Stealing

An Improved LP-based Approximation for Steiner Tree

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

A hardware-software codesign framework for cellular computing

Multiple Object Tracking using Flow Linear Programming

Multiple Object Tracking using Flow Linear Programming

Energy-Aware Processing Platform Exploration for Embedded Biosignal Analysis

Greedy Scheduling for Distributed Computing Clusters

An Improved LP-based Approximation for Steiner Tree

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

A hardware-software codesign framework for cellular computing

Multiple Object Tracking using Flow Linear Programming

Multiple Object Tracking using Flow Linear Programming

Scalable scheduling of energy control systems

An Ultra-Low-Power Application-Specific Processor with Sub-VT Memories for Compressed Sensing

A Tighter Analysis of Work Stealing