A. Marchetti-Spaccamela

Publications
Influence

Complexity and approximation: combinatorial optimization problems and their approximability properties

G. Ausiello, A. Marchetti-Spaccamela, P. Crescenzi, G. Gambosi, M. Protasi, V. Kann
Mathematics, Computer Science
9 November 1999

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

Sanjoy Baruah, V. Bonifaci, +4 authors L. Stougie
Computer Science
24th Euromicro Conference on Real-Time Systems
11 July 2012

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

Complexity and Approximation

G. Ausiello, A. Marchetti-Spaccamela, P. Crescenzi, G. Gambosi, M. Protasi, V. Kann
Computer Science
Springer Berlin Heidelberg
1999

Feasibility Analysis in the Sporadic DAG Task Model

V. Bonifaci, A. Marchetti-Spaccamela, S. Stiller, A. Wiese
Computer Science
25th Euromicro Conference on Real-Time Systems
9 July 2013

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

Mixed-Criticality Scheduling of Sporadic Task Systems

Sanjoy Baruah, V. Bonifaci, Gianlorenzo D’Angelo, A. Marchetti-Spaccamela, S. Ster, L. Stougie
Computer Science
ESA
5 September 2011

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

Multiprocessor scheduling with rejection

Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, L. Stougie
Computer Science, Mathematics
SODA '96
28 January 1996

We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected at a certain penalty. Expand

Response-Time Analysis of Conditional DAG Tasks in Multiprocessor Systems

Alessandra Melani, M. Bertogna, V. Bonifaci, A. Marchetti-Spaccamela, G. Buttazzo
Computer Science
27th Euromicro Conference on Real-Time Systems
8 July 2015

We propose the cp-task model as a generalization of the classic sporadic DAG task model, integrating conditional structures within the task model. Expand

Scheduling Real-Time Mixed-Criticality Jobs

Sanjoy Baruah, V. Bonifaci, +4 authors L. Stougie
Computer Science
IEEE Trans. Computers
1 August 2012

We study the complexity of MC-SCHEDULABILITY: determining whether a given mixed-criticality instance, specified according to our model, is schedulable or not. Expand

Counting triangles in data streams

L. Buriol, Gereon Frahling, S. Leonardi, A. Marchetti-Spaccamela, C. Sohler
Mathematics, Computer Science
PODS '06
26 June 2006

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

Scheduling Real-Time Mixed-Criticality Jobs

Sanjoy Baruah, V. Bonifaci, +4 authors L. Stougie
Computer Science
IEEE Transactions on Computers
23 August 2010

Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification… Expand

Recommended Authors