• Publications
  • Influence
Complexity and approximation: combinatorial optimization problems and their approximability properties
TLDR
This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. Expand
  • 1,368
  • 125
  • PDF
The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems
TLDR
In this paper, we consider the scheduling, upon preemptive uniprocessors, of mixed-criticality systems that can be modeled using a mixedcriticality generalization of the implicit-deadline sporadic tasks model. Expand
  • 212
  • 66
  • PDF
Complexity and Approximation
  • 900
  • 44
Feasibility Analysis in the Sporadic DAG Task Model
TLDR
We show that, even for DAG tasks, global EDF has a tight speed up bound of 2 − 1/m, where m is the number of processors, while DM has a speedup bound of at most 3 −1/m. Expand
  • 124
  • 25
  • PDF
Mixed-Criticality Scheduling of Sporadic Task Systems
TLDR
We show that any 2-level task system that is schedulable on a unit-speed processor is correctly scheduled by EDF-VD using speed φ here φ 2 criticality levels. Expand
  • 128
  • 24
  • PDF
Multiprocessor scheduling with rejection
TLDR
We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected at a certain penalty. Expand
  • 246
  • 22
  • PDF
Response-Time Analysis of Conditional DAG Tasks in Multiprocessor Systems
TLDR
We propose the cp-task model as a generalization of the classic sporadic DAG task model, integrating conditional structures within the task model. Expand
  • 80
  • 20
  • PDF
Scheduling Real-Time Mixed-Criticality Jobs
TLDR
We study the complexity of MC-SCHEDULABILITY: determining whether a given mixed-criticality instance, specified according to our model, is schedulable or not. Expand
  • 116
  • 17
Counting triangles in data streams
TLDR
We present two space bounded random sampling algorithms that compute an approximation of the number of triangles in an undirected graph given as a stream of edges. Expand
  • 235
  • 16
  • PDF
Scheduling Real-Time Mixed-Criticality Jobs
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certificationExpand
  • 74
  • 15
  • PDF
...
1
2
3
4
5
...