Feb 25 - Aida Ehyaei, ISEP, Portugal - Scalable Data Acquisition for Densely Instrumented Cyber-Physical Systems¶

Talk abstract: Consider the problem of designing an algorithm for acquiring sensor readings. Consider specifically the problem of obtaining an approximate representation of sensor readings where (i) sensor readings originate from different sensor nodes, (ii) the number of sensor nodes is very large, (iii) all sensor nodes are deployed in a small area (dense network) and (iv) all sensor nodes communicate over a communication medium where at most one node can transmit at a time (a single broadcast domain). We present an efficient algorithm for this problem, and our novel algorithm has two desired properties: (i) it obtains an interpolation based on all sensor readings and (ii) it is scalable, that is, its time-complexity is independent of the number of sensor nodes. Achieving these two properties is possible thanks to the close interlinking of the information processing algorithm, the communication system and a model of the physical world.

Speaker Bio.: Aida Ehyaei received her MSc. and BSc. degree in Electrical engineering from Isfahan University of technology, Iran. She is a PhD student in FEUP and does her research in CISTER Research Unit from September 2009. Currently, her research is in the field of Cyber Physical Systems.


Talk slides: pdf

March 4 - Claro Noda, ISEP, Portugal - Channel Quality Metric for Interference-aware WSN¶

Talk abstract:WSN operate in ISM bands and share the spectrum with other wireless technologies, thus interference is a relevant problem. In order to minimise its effect nodes can dynamically adapt radio resources to accommodate network traffic, provided information about spectrum usage is available. We present a new channel quality metric that is based on availability of the channel over time. We do experiments to investigate its parameter space and also show our metric has strong correlation with Packet Reception Rate. This suggest that quantifying interference in the channel can help in adapting radio resources to boost reliability and bound latency in packet delivery. We then entertain some resource adaptation techniques where the metric can help optimising them according to the channel condition.

Speaker Bio.:Claro Noda graduated in Physics from University of Havana, Cuba in 1996. He worked in Scientific Instrumentation at the Superconductivity Laboratory, IMRE (1996-2001) where he completed his Master in Physical Sciences in 2000 and later continued research activities at the "Henri Poincaré" Complex Systems Group. He has also taught at the General Physics Department in the Faculty of Physics in Havana (2005-2008). Currently he's a MAP-Tele PhD student at University of Minho and a researcher at CISTER/ISEP, Portugal.

March 11 - Gurulingesh Raravi, ISEP, Portugal - Assigning Real-Time Tasks on a Two-type Heterogeneous Multiprocessor Platform¶

Talk abstract:Consider the problem of scheduling a set of implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform to meet all deadlines. Tasks cannot migrate and each processor is either of type-1 or type-2 (with each task having different execution speed on each processor type). We present a new algorithm, FF-3C, for this problem. FF-3C offers low time-complexity and provably good performance. Specifically, (i) its time-complexity is O(n * max(m; log n)), where n is the number of tasks and m is the number of processors and (ii) it offers the guarantee that if a task set can be scheduled by an optimal task assignment scheme to meet deadlines then FF-3C meets deadlines as well if given processors twice as fast. We also present several extensions to FF-3C; these offer the same time-complexity and performance guarantee as that of FF-3C but in addition, they offer improved average-case performance. Via experiments with randomly generated task sets, we compare the performance of our new algorithms and two established state-of-art algorithms (and variations of the latter). We evaluate algorithms based on (i) running time and (ii) the necessary multiplication factor, i.e., the amount of extra speed of processors the algorithm needs, for a given task set, so as to succeed, compared to an optimal task assignment scheme. Overall our new algorithms compare favorably to the state-of-art. One in particular (FF-4CCOMB), in our experimental evaluations, runs 12000 to 160000 times faster and has significantly smaller necessary multiplication factor than state-of-art algorithms.

Speaker Bio.:Gurulingesh Raravi finished his Masters Degree at IIT Bombay in 2005. He has three years of working experience. Currently, he is pursuing PhD in the area of Real-Time Scheduling on Heterogeneous Multiprocessor Platform.

March 18 - Vikram Gupta, ISEP, Portugal¶

March 25 - Paulo Balrarejo Sousa, ISEP, Portugal¶

April 1 - Hossein Fotouhi, ISEP, Portugal¶

April 8 - Ricardo Severino, ISEP, Portugal¶

April 15 - Antonio Barros, ISEP, Portugal¶

April 29 - Dakshina Dasari, ISEP, Portugal¶

May 6 - Maryam Vahabi, ISEP, Portugal¶

May 13 - Jose Marinho, ISEP, Portugal¶

May 20 - Artem Burmyakov, ISEP, Portugal¶

May 27 - Ricardo Garibay-Martinez, ISEP, Portugal¶

June 3 - Muhammad Ali Awan, ISEP, Portugal¶

June 17 - Borislav Nikolic, ISEP, Portugal¶

June 24 - Suhas Aggarwal, ISEP, Portugal¶

July 1 - Konstiantyn Berezovskyi, ISEP, Portugal¶

July 8 - Hazem Ali, ISEP, Portugal¶

July 15 - Claudio Maia, ISEP, Portugal¶