Online stable matching as a means of allocating distributed resources Academic Article

abstract

• In heterogeneous distributed systems, achieving optimality in both effective use of computational resources (e.g. throughput) and user satisfaction (e.g. response time) is an important unresolved problem. If the users of the system participate dynamically as consumers as well as donors of computational resources, the task of optimizing the exchange of these computational resources leads to a combinatorial problem. As a solution, we propose a novel algorithm, adaptive online stable matching (AOSM). We present experimental data which compare the performance of AOSM with the performance of two alternative algorithms, first-come first-served (FCFS) and fixed-k online.

authors

• Lee, Hyunyoung

published proceedings

• JOURNAL OF SYSTEMS ARCHITECTURE

author list (cited authors)

• Lee, H.

citation count

• 6

complete list of authors

• Lee, H

publication date

• September 1999

publisher

• Elsevier  Publisher

published in

• Journal of Systems Architecture  Journal

keywords

• Adaptive Windowing
• Approximation
• Distributed Resources
• Online Algorithm
• Stable Matching

Digital Object Identifier (DOI)

• 10.1016/S1383-7621(98)00072-1

start page

• 1345

end page

• 1355

volume

• 45

issue

• 15

URL

• http%3A%2F%2Fdx.doi.org%2F10.1016%2Fs1383-7621%2898%2900072-1