136,139 research outputs found
LUNES: Agent-based Simulation of P2P Systems (Extended Version)
We present LUNES, an agent-based Large Unstructured NEtwork Simulator, which
allows to simulate complex networks composed of a high number of nodes. LUNES
is modular, since it splits the three phases of network topology creation,
protocol simulation and performance evaluation. This permits to easily
integrate external software tools into the main software architecture. The
simulation of the interaction protocols among network nodes is performed via a
simulation middleware that supports both the sequential and the
parallel/distributed simulation approaches. In the latter case, a specific
mechanism for the communication overhead-reduction is used; this guarantees
high levels of performance and scalability. To demonstrate the efficiency of
LUNES, we test the simulator with gossip protocols executed on top of networks
(representing peer-to-peer overlays), generated with different topologies.
Results demonstrate the effectiveness of the proposed approach.Comment: Proceedings of the International Workshop on Modeling and Simulation
of Peer-to-Peer Architectures and Systems (MOSPAS 2011). As part of the 2011
International Conference on High Performance Computing and Simulation (HPCS
2011
Initial synchronisation of wideband and UWB direct sequence systems: single- and multiple-antenna aided solutions
This survey guides the reader through the open literature on the principle of initial synchronisation in single-antenna-assisted single- and multi-carrier Code Division Multiple Access (CDMA) as well as Direct Sequence-Ultra WideBand (DS-UWB) systems, with special emphasis on the DownLink (DL). There is a paucity of up-to-date surveys and review articles on initial synchronization solutions for MIMO-aided and cooperative systems - even though there is a plethora of papers on both MIMOs and on cooperative systems, which assume perfect synchronization. Hence this paper aims to ?ll the related gap in the literature
Transparent Orchestration of Task-based Parallel Applications in Containers Platforms
This paper presents a framework to easily build and execute parallel applications in container-based distributed computing platforms in a user-transparent way. The proposed framework is a combination of the COMP Superscalar (COMPSs) programming model and runtime, which provides a straightforward way to develop task-based parallel applications from sequential codes, and containers management platforms that ease the deployment of applications in computing environments (as Docker, Mesos or Singularity). This framework provides scientists and developers with an easy way to implement parallel distributed applications and deploy them in a one-click fashion. We have built a prototype which integrates COMPSs with different containers engines in different scenarios: i) a Docker cluster, ii) a Mesos cluster, and iii) Singularity in an HPC cluster. We have evaluated the overhead in the building phase, deployment and execution of two benchmark applications compared to a Cloud testbed based on KVM and OpenStack and to the usage of bare metal nodes. We have observed an important gain in comparison to cloud environments during the building and deployment phases. This enables better adaptation of resources with respect to the computational load. In contrast, we detected an extra overhead during the execution, which is mainly due to the multi-host Docker networking.This work is partly supported by the Spanish Government through Programa Severo Ochoa (SEV-2015-0493), by the Spanish Ministry of Science and Technology through TIN2015-65316 project, by the Generalitat de Catalunya under contracts 2014-SGR-1051 and 2014-SGR-1272, and by the European Union through the Horizon 2020 research and innovation program under grant 690116 (EUBra-BIGSEA Project). Results presented in this paper were obtained using the Chameleon testbed supported by the National Science Foundation.Peer ReviewedPostprint (author's final draft
Problem-Solving Knowledge Mining from Usersâ\ud Actions in an Intelligent Tutoring System
In an intelligent tutoring system (ITS), the domain expert should provide\ud
relevant domain knowledge to the tutor so that it will be able to guide the\ud
learner during problem solving. However, in several domains, this knowledge is\ud
not predetermined and should be captured or learned from expert users as well as\ud
intermediate and novice users. Our hypothesis is that, knowledge discovery (KD)\ud
techniques can help to build this domain intelligence in ITS. This paper proposes\ud
a framework to capture problem-solving knowledge using a promising approach\ud
of data and knowledge discovery based on a combination of sequential pattern\ud
mining and association rules discovery techniques. The framework has been implemented\ud
and is used to discover new meta knowledge and rules in a given domain\ud
which then extend domain knowledge and serve as problem space allowing\ud
the intelligent tutoring system to guide learners in problem-solving situations.\ud
Preliminary experiments have been conducted using the framework as an alternative\ud
to a path-planning problem solver in CanadarmTutor
On Non-Parallelizable Deterministic Client Puzzle Scheme with Batch Verification Modes
A (computational) client puzzle scheme enables a client to prove to a server that a certain amount of computing resources (CPU cycles and/or Memory look-ups) has been dedicated to solve a puzzle. Researchers have identified a number of potential applications, such as constructing timed cryptography, fighting junk emails, and protecting critical infrastructure from DoS attacks. In this paper, we first revisit this concept and formally define two properties, namely deterministic computation and parallel computation resistance. Our analysis show that both properties are crucial for the effectiveness of client puzzle schemes in most application scenarios. We prove that the RSW client puzzle scheme, which is based on the repeated squaring technique, achieves both properties. Secondly, we introduce two batch verification modes for the RSW client puzzle scheme in order to improve the verification efficiency of the server, and investigate three methods for handling errors in batch verifications. Lastly, we show that client puzzle schemes can be integrated with reputation systems to further improve the effectiveness in practice
An Integrated Market for Electricity and Natural Gas Systems with Stochastic Power Producers
In energy systems with high shares of weather-driven renewable power sources,
gas-fired power plants can serve as a back-up technology to ensure security of
supply and provide short-term flexibility. Therefore, a tighter coordination
between electricity and natural gas networks is foreseen. In this work, we
examine different levels of coordination in terms of system integration and
time coupling of trading floors. We propose an integrated operational model for
electricity and natural gas systems under uncertain power supply by applying
two-stage stochastic programming. This formulation co-optimizes day-ahead and
real-time dispatch of both energy systems and aims at minimizing the total
expected cost. Additionally, two deterministic models, one of an integrated
energy system and one that treats the two systems independently, are presented.
We utilize a formulation that considers the linepack of the natural gas system,
while it results in a tractable mixed-integer linear programming (MILP) model.
Our analysis demonstrates the effectiveness of the proposed model in
accommodating high shares of renewables and the importance of proper natural
gas system modeling in short-term operations to reveal valuable flexibility of
the natural gas system. Moreover, we identify the coordination parameters
between the two markets and show their impact on the system's operation and
dispatch
- âŠ