2013
Autores
Marques, ERB; Martins, F; Vasconcelos, VT; Ng, N; Martins, N;
Publicação
Proceedings 6th Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, PLACES 2013, Rome, Italy, 23rd March 2013.
Abstract
The Message Passing Interface (MPI) is the de facto standard message-passing infrastructure for developing parallel applications. Two decades after the first version of the library specification, MPI-based applications are nowadays routinely deployed on super and cluster computers. These applications, written in C or Fortran, exhibit intricate message passing behaviours, making it hard to statically verify important properties such as the absence of deadlocks. Our work builds on session types, a theory for describing protocols that provides for correct-by-construction guarantees in this regard. We annotate MPI primitives and C code with session type contracts, written in the language of a software verifier for C. Annotated code is then checked for correctness with the software verifier. We present preliminary results and discuss the challenges that lie ahead for verifying realistic MPI program compliance against session types.
2013
Autores
Marques, ERB;
Publicação
5th Workshop on Hot Topics in Software Upgrades, HotSWUp'13, San Jose, CA, USA, June 28, 2013
Abstract
2013
Autores
Pinto, P; Pinto, A; Ricardo, M;
Publicação
2013 IFIP WIRELESS DAYS (WD)
Abstract
Critical monitoring applications can use wireless sensor networks to transport delay sensitive data. This data may demand bounded delays in order to be considered useful by the receiver. In these cases, an accurate and real-time estimation of the end-to-end delay could be used to anticipate the data usefulness prior to sending it. A novel real-time and end-to-end delay estimation mechanism is proposed in this paper, which considers processing times and two new RPL metrics. Results show that our proposal is more accurate than the ETT-based solution for delay estimation, and it does not significantly degrade the network performance.
2013
Autores
Santos, A; Nogueira, R; Lourenço, A;
Publicação
ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal
Abstract
2013
Autores
Dalmazo, BL; Vilela, JP; Curado, M;
Publicação
2013 IEEE THIRD INTERNATIONAL CONFERENCE ON CLOUD AND GREEN COMPUTING (CGC 2013)
Abstract
Monitoring and managing traffic are vital elements to the operation of a network. Traffic prediction is an essential tool that captures the underlying behavior of a network and can be used, for example, to detect anomalies by defining acceptable data traffic thresholds. In this context, most current solutions are heavily based on historical time data, which makes it difficult to employ them in a dynamic environment such as cloud computing. We propose a traffic prediction approach based on a statistical model where observations are weighted with a Poisson distribution inside a sliding window. The evaluation of the proposed method is performed by assessing the Normalized Mean Square Error of predicted values over observed values from a real cloud computing dataset, collected by monitoring the utilization of Dropbox. Compared with other predictors, our solution exhibits the strongest correlation level and shows a close match with real observations.
2013
Autores
Vilela, JP; Barros, J;
Publicação
2013 IEEE 14th International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2013
Abstract
We present a collision-free jammer selection policy for enhanced wireless secrecy. Jammers, selected from the neighbors of a source, are friendly in the sense that they are willing to help the source to transmit securely by causing interference/collisions to possible eavesdroppers. The proposed jammer selection policy results in the selection of the largest number of jammers that do not cause collisions among themselves. This enables jammers to assist the source to transmit securely by causing interference to eavesdroppers, while sending their own traffic into the network. © 2013 IEEE.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.