Person: Martín Martín, Enrique
Loading...
First Name
Enrique
Last Name
Martín Martín
Affiliation
Universidad Complutense de Madrid
Faculty / Institute
Informática
Department
Sistemas Informáticos y Computación
Area
Lenguajes y Sistemas Informáticos
Identifiers
4 results
Search Results
Now showing 1 - 4 of 4
- Project number: 18
Item Juez automático para el aprendizaje de bases de datos(2021) Martín Martín, Enrique; Burgoa Muñoz, Iker; Rubio Cuéllar, Rubén Rafael; Cerro Cañizares, Pablo; Correas Fernández, Jesús; Montenegro Montes, Manuel; Riesco Rodríguez, AdriánProponemos desarrollar un juez automático para el aprendizaje de bases de datos. Este sistema web permitirá a los estudiantes practicar con diferentes ejercicios de bases de datos desde casa y recibir retroalimentación inmediata sobre los fallos. - Project number: 387
Item Evaluación del impacto sobre el aprendizaje de bases de datos del juez automático LearnSQL(2022) Martín Martín, Enrique; Correas Fernández, Jesús; Garmendia Salvador, Luis; Montenegro Montes, Manuel; Riesco Rodríguez, Adrián; Rubio Cuéllar, Rubén Rafael; Sáenz Pérez, FernandoUtilizamos el juez automático "LearnSQL" en la docencia de varios grupos de la asignatura "Bases de Datos" y medimos de manera rigurosa y extensiva el impacto que este tiene sobre el aprendizaje de los estudiantes. Item Static Inference of Transmission Data Sizes in Distributed Systems(2014) Albert Albiol, Elvira María; Correas Fernández, Jesús; Martín Martín, Enrique; Román Díez, GuillermoWe present a static analysis to infer the amount of data that a distributed system may ransmit. The different locations of a distributed system communicate and coordinate their actions by posting tasks among them. A task is posted by building a message with the task name and the data on which such task has to be executed. When the task completes, the result can be retrieved by means of another message from which the result of the computation can be obtained. Thus, the transmission data size of a distributed system mainly depends on the amount of messages posted among the locations of the system, and the sizes of the data transferred in the messages. Our static analysis has two main parts: (1) we over-approximate the sizes of the data at the program points where tasks are spawned and where the results are received, and (2) we over-approximate the total number of messages. Knowledge of the transmission data sizes is essential, among other things, to predict the bandwidth required to achieve a certain response time, or conversely, to estimate the response time for a given bandwidth. A prototype implementation in the SACO system demonstrates the accuracy and feasibility of the proposed analysis.Item Resource Analysis: From Sequential to Concurrent and Distributed Programs(2015) Albert Albiol, Elvira María; Arenas Sánchez, Purificación; Correas Fernández, Jesús; Genaim, Samir; Gómez Zamalloa, Miguel; Martín Martín, Enrique; Puebla, Germán; Román Díez, GuillermoResource analysis aims at automatically inferring upper/lower bounds on the worst/best-case cost of executing programs. Ideally, a resource analyzer should be parametric on the cost model, i.e., the type of cost that the user wants infer (e.g., number of steps, amount of memory allocated, amount of data transmitted, etc.). The inferred upper bounds have important applications in the fields of program optimization, verification and certification. In this talk, we will review the basic techniques used in resource analysis of sequential programs and the new extensions needed to handle concurrent and distributed systems.