BibTeX database: published research of Andras Salamon
Version 1.02 of 2007-07-03
this file is available from http://www.gaon.net/andras/academic/azs.bib

@TECHREPORT{ Salamon1991:inherent,
	author = "Andr{\'a}s Salamon and Hanoch Neishlos",
	title = "Inherent Limitations on Parallel Program Performance",
	institution = "University of the Witwatersrand",
	year = 1991,
	number = "TR--1991--02",
	address = "Department of Computer Science, 2050 WITS, South Africa",
	month = may,
	url = {http://www.gaon.net/andras/academic/TR-Wits-CS-1991-2.pdf}
}

@TECHREPORT{ Salamon2001:task,
	author = "A. Salamon",
	title = "{Task Graph Performance Bounds Through Comparison Methods}",
	institution = "{Department of Computer Science, University of the
	Witwatersrand}",
	year = 2001,
	month = jan,
	type = "Technical Report",
	number = "TR-Wits-CS-2001-0",
	url = "http://www.gaon.net/andras/academic/TR-Wits-CS-2001-0.pdf",
	citeseer = "http://citeseer.ist.psu.edu/salamon01task.html",
	note = "(141 pages)",
	abstract = {
When a parallel computation is represented in a formalism that imposes
series-parallel structure on its task graph, it becomes amenable to
automated analysis and scheduling.  Unfortunately, its execution time
will usually also increase as precedence constraints are added to ensure
series-parallel structure.  Bounding the slowdown ratio would allow an
informed tradeoff between the benefits of a restrictive formalism and
its cost in loss of performance.

This dissertation deals with series-parallelising task graphs by
adding precedence constraints to a task graph, to make the resulting
task graph series-parallel.  The weak bounded slowdown conjecture for
series-parallelising task graphs is introduced.  This states that the
slowdown is bounded if information about the workload can be used to
guide the selection of which precedence constraints to add.  A theory of
best series-parallelisations is developed to investigate this conjecture.
Partial evidence is presented that the weak slowdown bound is likely to
be 4/3, and this bound is shown to be tight.
	}
}

@MASTERSTHESIS( Salamon2001:thesis,
	author = "Andr{\'a}s Zolt{\'a}n Salamon",
	title = "Task Graph Performance Bounds Through Comparison Methods",
	school = "University of the Witwatersrand, Johannesburg",
	year = 2001,
	month = jan,
)

@MISC( Salamon2004:modulardecomp,
	author = "Andr{\'a}s Salamon",
	title = "Perl CPAN module Graph::ModularDecomposition",
	year = {2004},
	url = {http://www.gaon.net/dist/graph/},
)

@MISC( Salamon2005:liftutils,
	author = "Andr{\'a}s Salamon",
	title = "Perl module AI::Constraints::LiftUtils",
	year = {2005},
	url = {http://www.gaon.net/dist/lift/},
)