Optimising the distributed execution of join queries in polynomial time

Reid, Darryn J.

doi:10.1016/s0898-1221(99)00051-6

Cited by 5 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reference [16] proposes a model similar to ours in that it defines cost and weight function to model requirements on resource usage, as proposed in Section 3, in addition to the 0-1 Integer Linear Programming (ILP) problem formulation. It does not, however, support reconfiguration and system and application requirements are not included in the model.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Untitled

Abdu

Lutfiyya

Bauer

2002

Journal of Network and Systems Management

View full text Add to dashboard Cite

With the increased availability and complexity of distributed systems comes a greater need for solutions to assist in the management of distributed systems. Despite the significant contributions made towards the development of management tools that monitor and control distributed systems, little has been done to address issues such as optimizing the execution of management functions with respect to system and management requirements. This paper presents a management optimization model in which management agents and managed objects are efficiently configured on the basis of a set of system and management requirements. We illustrate our model and describe its implementation through a Branch-and Bound-based algorithm and a web-based interface. The latter enables users to specify the requirements used by the optimization algorithm to determine efficient management configurations. It also includes an XML-based interface through which management agents can be started independent of the underlying platforms. Performance characteristics of the proposed algorithm as well as experimental results to illustrate the validity of the model are also described.

show abstract

Section: Related Workmentioning

confidence: 99%

“…This problem was shown to be an NP-complete [17] combinatorial optimization problem. We draw upon optimisation problems similar to ours [16] and model the problem as a 0-1 ILP [18] problem ( [19]):…”

Section: Modelmentioning

confidence: 99%