search query: @keyword smart spaces / total: 3
reference: 2 / 3
« previous | next »
Author:Aziz, Rehan Abdul
Title:Distributed rule-based resource allocation in smart spaces
Publication type:Master's thesis
Publication year:2011
Pages:vi + 67      Language:   eng
Department/School:Tietotekniikan laitos
Main subject:Tietojenkäsittelyteoria   (T-119)
Supervisor:Janhunen, Tomi
Instructor:Luukkala, Vesa
OEVS:
Electronic archive copy is available via Aalto Thesis Database.
Instructions

Reading digital theses in the closed network of the Aalto University Harald Herlin Learning Centre

In the closed network of Learning Centre you can read digital and digitized theses not available in the open network.

The Learning Centre contact details and opening hours: https://learningcentre.aalto.fi/en/harald-herlin-learning-centre/

You can read theses on the Learning Centre customer computers, which are available on all floors.

Logging on to the customer computers

  • Aalto University staff members log on to the customer computer using the Aalto username and password.
  • Other customers log on using a shared username and password.

Opening a thesis

  • On the desktop of the customer computers, you will find an icon titled:

    Aalto Thesis Database

  • Click on the icon to search for and open the thesis you are looking for from Aaltodoc database. You can find the thesis file by clicking the link on the OEV or OEVS field.

Reading the thesis

  • You can either print the thesis or read it on the customer computer screen.
  • You cannot save the thesis file on a flash drive or email it.
  • You cannot copy text or images from the file.
  • You cannot edit the file.

Printing the thesis

  • You can print the thesis for your personal study or research use.
  • Aalto University students and staff members may print black-and-white prints on the PrintingPoint devices when using the computer with personal Aalto username and password. Color printing is possible using the printer u90203-psc3, which is located near the customer service. Color printing is subject to a charge to Aalto University students and staff members.
  • Other customers can use the printer u90203-psc3. All printing is subject to a charge to non-University members.
Location:P1 Ark Aalto     | Archive
Keywords:smart spaces
ubiquitous computing
answer set programming
resource allocation
deadlock detection
deadlock resolution
Abstract (eng): A smart space is an abstract and distributed entity composed of interacting digital devices.
Creation of smart spaces whose components can share information interoperable is one of the challenges in the field of ubiquitous computing.
Smart-M3 is an implementation that provides interoperability in smart spaces using the ideas of Semantic Web.
In these smart spaces, at any given time, there are resources as well as consumers that wish to use those resources.

Since these resources, or capabilities, have limited capacities, some mechanism of resource allocation must be devised.
Unfortunately, as the number of resources and their consumers grow, doing resource allocation efficiently demands more computation.
Moreover, allocating resources in a competitive environment could also give rise to deadlocks in the system in which each user involved in the deadlock is unable to proceed for an indefinite period of time.
Therefore, a strategy to detect and eliminate these deadlocks also needs to be in place.
Deadlock handling also requires more computation time and memory as the size of the smart space increases.

In this thesis, we present a distributed approach to resource allocation and deadlock handling in smart spaces using Answer Set Programming (ASP) techniques.
ASP is a declarative programming paradigm and it is a useful way of defining policies for capabilities to resolve conflicts since policies can be expressed in terms of rules.
A centralized approach using a single ASP rule-engine was already discussed, along with its shortcomings in previous work.
The centralized approach fails to scale efficiently for larger smart spaces.
Distributing resource allocation and deadlock detection however, introduces complexities that arise due to splitting the problem instance into several smaller instances.

This thesis extends the centralized approach and applies it to a distributed setting by catering for these complexities using two approaches: distributed deadlock detection and deadlock prevention.
Other than merely devising strategies to distribute the problem -and to some extent because of it we also introduce modularity in the new approach resulting in a more structured and optimized solution.
Several comparisons between the central and distributed approaches are given in terms of execution time and amount of traffic.
Our results show that the new distributed approach exploits parallelism and is efficient to be applied for smart spaces of larger sizes.
ED:2011-10-05
INSSI record number: 42865
+ add basket
« previous | next »
INSSI