Håkan Lennerstad

An Optimal Execution Time Estimate of Static versus Dynamic Allocation in Multiprocessor Systems

Consider a multiprocessor with

An optimal upper bound on the minimal completion time in distributed supercomputing

k

Optimal recovery schemes in fault tolerant distributed computing

identical processors, executing parallel programs consisting of

An optimal lower bound on the maximum speedup in multiprocessors with clusters

n

Global multiprocessor scheduling of aperiodic tasks using time-independent priorities

processes. Let

Using recorded values for bounding the minimum completion time in multiprocessors

T_s(P)

Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems

and

Using Golomb rulers for optimal recovery schemes in fault tolerant distributed computing

T_d(P)

Optimal Worst Case Formulas Comparing Cache Memory Associativity

denote the execution times for the program

Guaranteeing Response Times for Aperiodic Tasks in Global Multiprocessor Scheduling

P