Papers by Mara Mezzapesa Marzolla
Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings., 2003
In this paper we describe the architecture of PerfMC, a Performance Monitoring system for Cluster... more In this paper we describe the architecture of PerfMC, a Performance Monitoring system for Clusters of Worksta- tions (CoW); a prototype implementation of the architec- ture is also presented. PerfMC is driven by an XML con- figuration file, and uses the Simple Network Management Protocol (SNMP) to collect statistics from each networked equipment. The collected data are maintained on the lo- cal disk of the monitoring station in a compact format, and various graphical and statistical analyses can be performed off-line. The monitoring tool embeds an HTTP server which is able to generate various types of graphs from the col- lected data. Moreover, the HTTP server can generate arbi- trary XML pages by dynamically applying XSLT stylesheets to an internal XML representation of the cluster's status. The heavy use of XML-based technologies differentiates the proposed approach to traditional monitoring tools.
First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings., 2004
In this paper we describe UML-Ψ, a software performance evaluation tool based on process-oriented... more In this paper we describe UML-Ψ, a software performance evaluation tool based on process-oriented simulation. The tool can be used to evaluate performances of software systems described as annotated UML diagrams. UML-Ψ transforms the software model into a performance model based on process-oriented simulation, executes the performance model and collects results. Performance results are inserted into the software model as tagged values associated to the relevant UML elements.
32nd EUROMICRO Conference on Software Engineering and Advanced Applications (EUROMICRO'06), 2006
Performance evaluation of Component-Based software systems should be performed as early as possib... more Performance evaluation of Component-Based software systems should be performed as early as possible during the software development life cycle. Unfortunately, a detailed quantitative analysis is often not possible during such stages, as only the system outline is available, with very little quantitative knowledge. In this paper we propose an approach based on Queueing Network analysis for performance evaluation of component-based software systems at the software architectural level. Our approach provides performance bounds which can be efficiently computed. Starting from annotated UML diagrams we compute bounds on the system throughput and response time without explicitly deriving or solving the underlying multichain and multiclass Queueing Network model. We illustrate with an example how the technique can be applied to answer many performance-related questions which may arise during the software design phase.
14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06), 2006
CoreGRID
17th International Conference on Database and Expert Systems Applications (DEXA'06), 2006
The convergence of the worlds has led to many solutions that try to efficiently solve the problem... more The convergence of the worlds has led to many solutions that try to efficiently solve the problem of resource discovery on Grids. Some of these solutions are extensions of P2P DHT-based networks. We believe that these systems are not flexible enough in the case the data present in the network is very dynamic, i.e. the data values change very frequently over time. This a very common case for some kind of data in typical Grid systems, like CPU loads, queue occupation, etc. In this paper we present a variation of a previous work based on a tree-shaped P2P overlay network. The system uses Routing Indexes to efficiently route queries and update messages in the presence of highly variable data. The new system is based on a twolevel hierarchical network topology, where tree topologies must be only maintained at the lower level of the hierarchy. The main aim of this new organization is to achieve a simpler maintenance of the overall P2P graph topology. This is reached at the cost of some imprecision in the routing indexes built at the upper level of the graph hierarchy.
16th International Workshop on Database and Expert Systems Applications (DEXA'05), 2005
Resource discovery in a Grid environment is a critical problem, as a typical Grid system includes... more Resource discovery in a Grid environment is a critical problem, as a typical Grid system includes a very large number of resources, which must be readily identified and accessed to run applications. Traditional Grid discovery algorithms perform poorly, as they do not scale, nor allow Grid-enabled applications to transparently query the whole set of Grid resources. Peer-to-Peer (P2P) has been argued as a suitable distributed paradigm that not only overcomes the issues of scalability of such discovery systems, but also better supports the discovery of resources in a context of dynamicity of resources and associated information. In this paper we propose a P2P system for indexing and discovering Grid resources. We assume that Grid resources are characterized by a set of attributes, and our system can be queried for resources satisfying arbitrary range conditions on these attributes. Note that traditional P2P searching techniques can not be directly applied in this case, since they work well mostly for static content and exact queries. Simulation results show that the system provides an adequate degree of scalability.
16th International Workshop on Database and Expert Systems Applications (DEXA'05), 2005
Uploads
Papers by Mara Mezzapesa Marzolla