{"title":"Nonlinear Modelling of RF GaN Devices and Utilization in RF Power Amplifiers for 4G Applications","authors":"AbdelazizM. Abdelbar, A. El-Tager","doi":"10.1109/HPCS.2018.00026","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00026","url":null,"abstract":"This paper studies the large signal modeling of Gallium Nitride (GaN) High Electron Mobility Transistor (HEMT) and optimizes a nonlinear model of GaN HEMT that takes into account both small and large signal behavior based on Angelov model. The performance of the optimized model is verified with a selected GaN HEMT (TriQuint TGF2023-01) and compared to GaAs HEMT (NEC 900175) and an early study fabricating GaN Hetero-junction Bipolar Transistor (HBT) through DC characteristics, S- parameter simulations, cut-off frequency, output gain, minimum noise figure, and stability. Finally, the optimized GaN HEMT model is validated through utilizing it in an RF power amplifier design for 4G applications. It achieves double efficiency and 7dB enhancement in the maximum output power when compared to GaAs HEMT conventional design. In addition, the adjacent channel power ratio is increased by (15-20) dBc which makes the transmission mask deeply complies with the WiMax standard.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130773967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Scalability of Hybrid Sparse Matrix Dense Vector (SpMV) Multiplication","authors":"Brian A. Page, P. Kogge","doi":"10.1109/HPCS.2018.00072","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00072","url":null,"abstract":"SpMV, the product of a sparse matrix and a dense vector, is emblematic of a new class of applications that are memory bandwidth and communication, not flop, driven. Sparsity and randomness in such computations play havoc with conventional implementations, especially when strong, instead of weak, scaling is attempted. This paper studies improved hybrid SpMV codes that have better performance, especially for the sparsest of such problems. Issues with both data placement and remote reductions are modeled over a range of matrix characteristics. Those factors that limit strong scalability are quantified.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115508126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Jubertie, Emmanuel Melin, Naly Raliravaka, E. Bodèle, P. E. Bocanegra
{"title":"Impact of Vectorization and Multithreading on Performance and Energy Consumption on Jetson Boards","authors":"S. Jubertie, Emmanuel Melin, Naly Raliravaka, E. Bodèle, P. E. Bocanegra","doi":"10.1109/HPCS.2018.00055","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00055","url":null,"abstract":"ARM processors are well known for their energy efficiency and are consequently widely used in embedded platforms. Like other processor architectures, they are built with different levels of parallelism, from Instruction Level Parallelism (out-of- order and superscalar capabilities) to Thread Level Parallelism (multicore), to increase their performance levels. These processors are now also targeting the HPC domain and will equip the Fujitsu Post-K supercomputer. Some ARM processors from the Cortex-A series, which equip smartphones and tablets, also provide Data Level Parallelism through SIMD units called NEON. These units are able to process 128-bit of data at a time, for example four 32bit floating point values. Taking advantage of these units requires code vectorization which may be performed automatically by the compiler or explicitly by using NEON intrinsics. Exploiting all these levels of parallelism may lead to better performance as well as a higher energy consumption. This is not an issue in the HPC domain where application development is driven by finding the best performance. However, developing for embedded applications is driven by finding the best trade-off between energy consumption and performance. In this paper, we propose to study the impact of vectorization and multithreading on both performance and energy consumption on some Nvidia Jetson boards. Results show that depending on the algorithm and on its implementation, vectorization may bring a similar speedup as an OpenMP scalar implementation but with a lower energy consumption. However, combining vectorization and multithreading may lead close to both the best performance level and the lowest energy consumption but not when running cores at their maximum frequencies.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"31 35","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113941297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"GPU-Accelerated Simulation of Elastic Wave Propagation","authors":"Kristian Kadlubiak, J. Jaros, B. Treeby","doi":"10.1109/HPCS.2018.00044","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00044","url":null,"abstract":"Modeling of ultrasound waves propagation in hard biological materials such as bones and skull has a rapidly growing area of applications, e.g. brain cancer treatment planing, deep brain neurostimulation and neuromodulation, and opening blood brain barriers. Recently, we have developed a novel numerical model of elastic wave propagation based on the Kelvin-Voigt model accounting for linear elastic wave proration in heterogeneous absorption media. Although, the model offers unprecedented fidelity, its computational requirements have been prohibitive for realistic simulations. This paper presents an optimized version of the simulation model accelerated by the Nvidia CUDA language and deployed on the best GPUs including the Nvidia P100 accelerators present in the Piz Daint supercomputer. The native CUDA code reaches a speed-up of 5.4 when compared to the Matlab prototype accelerated by the Parallel Computing Toolbox running on the same GPU. Such reduction in computation time enables computation of large-scale treatment plans in terms of hours.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"1188 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114048429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ali Al Takach, F. Ndagijimana, J. Jomaah, M. Al‐Husseini
{"title":"3D-Printed Low-Cost and Lightweight TEM Cell","authors":"Ali Al Takach, F. Ndagijimana, J. Jomaah, M. Al‐Husseini","doi":"10.1109/HPCS.2018.00022","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00022","url":null,"abstract":"This paper presents a 3D-printed, low-cost and lightweight transverse electromagnetic (TEM) cell that functions as good as traditional metal TEM cells. An open TEM cell is first designed and simulated. Later, a prototype is fabricated by printing the different parts using an inexpensive 3D printer. The cell's operating bandwidth spans the range from DC to 1.6 GHz. The results show acceptable agreement between the simulated and measured S-parameters. The paper also reports the mapping of the E-field inside the designed TEM cell.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116617045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Guilherme A. Borges, Rômulo Reis de Oliveira, T. Ferreto, C. Geyer
{"title":"A Novel Model to Computational Offloading on Autonomic Managers: a Mobile Test Bed","authors":"Guilherme A. Borges, Rômulo Reis de Oliveira, T. Ferreto, C. Geyer","doi":"10.1109/HPCS.2018.00040","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00040","url":null,"abstract":"The technological advance of mobile devices, networks and cloud technologies progressed and reduced their access costs to the whole human population. Besides that, mobile devices are still limited in the battery capacity, storage, and connectivity. An efficient way to manage their resources is to make the applications self-adaptive and context-aware using the MAPE-K loop model. However, even this method can add a considerable processing cost to their devices. This paper proposes to reduce such costs by applying the computational offloading technique into the classical MAPE-K loop. In this way, we analyzed it based on literature evidence to find a suitable process that allows offloading to remote and cloud servers. The results through experimentation on the proposed model show that there is a substantial performance increasing in the planning activity remote executions compared to the local ones, what is also affected by the distance from the servers.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123234295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
L. Spalazzi, Francesco Spegni, Giovanni Liva, M. Pinzger
{"title":"Towards Model Checking Security of Real Time Java Software","authors":"L. Spalazzi, Francesco Spegni, Giovanni Liva, M. Pinzger","doi":"10.1109/HPCS.2018.00106","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00106","url":null,"abstract":"More and more software libraries and applications in high-performance computing and distributed systems are coded using the Java programming language. The correctness of such pieces of code w.r.t. a given set of security policies often depends on the correct handling of timing between concurrent or recurrent events. Model-checking has proven to be an effective tool for verifying the correctness of software. In spite of the growing importance of this application area of formal methods, though, no approach exists that targets the problem of verifying the correctness of real-time software w.r.t. timed specifications. The few existing works focus on very different problems, such as schedulability analysis of Java tasks. In this paper we present an approach combining rule-based static analysis together with symbolic execution of Java code to extract networks of timed automata from existing software and then use Uppaal to model-check them against timed specifications. We show through a real-world case study that this approach can be helpful in model-checking security policies of real-time Java software.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128285818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fast Computation of High-resolution Solvent Excluded Protein Surface with OpenMP","authors":"Sebastian Daberdaku, Carlo Ferrari","doi":"10.1109/HPCS.2018.00127","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00127","url":null,"abstract":"The solvent-excluded surface of proteins is extremely useful when studying their properties and interactions as it represents the portion of the outer protein contour that is available to interact with the solvent and other molecules. Given their simplicity and ability to represent geometrical and physico- chemical properties of proteins, voxelised surface representations have received a lot of interest in bioinformatics and computational biology applications such as protein-protein docking, interaction interface prediction and ligand-binding pocket prediction. Computing voxelised surfaces for large proteins can be challenging, as space-demanding data structures with associated high computational costs are required. In this paper we present a fast, OpenMP-based parallel algorithm for the computation of high-resolution voxelised solvent-excluded protein surfaces. The methodology is based on a region-growing implementation of the approximate Euclidean Distance Transform algorithm with Hierarchical Queues. The geometrical relationship between the solvent-accessible and solvent-excluded surfaces allows us to obtain the latter very efficiently by computing distance map values only for a small subset of the overall voxels representing the protein. The algorithm computes the contribution to the overall outer surface for each atom in parallel. The proposed methodology was experimentally compared to two previous MPI- based parallel implementations showing overall better speedup and efficiency metrics as well as lower surface computation times.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128354363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Selective and Incremental Backup Scheme for Task Pools","authors":"Claudia Fohry, Jonas Posner, Lukas Reitz","doi":"10.1109/HPCS.2018.00103","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00103","url":null,"abstract":"Checkpointing is a common approach to prevent loss of a program's state after permanent node failures. When it is performed on application-level, less data need to be saved. This paper suggests an uncoordinated application-level checkpointing technique for task pools. It selectively and incrementally saves only those tasks that have stayed in the pool during some period of time and that have not been saved before. The checkpoints are held in a resilient in-memory data store. Our technique applies to any task pool variant in which workers operate at the top of local pools, and work stealing operates at the bottom. Furthermore, the tasks must be free of side effects, and the final result must be calculated by reduction from individual task results. We implemented the technique for the lifeline-based global load balancing variant of task pools. This variant couples random victim selection with an overlay graph for termination detection. A fault-tolerant realization already exists in the form of a Java library, called JFT_GLB. It uses the APGAS and Hazelcast libraries underneath. Our implementation modifies JFT_GLB by replacing its nonselective checkpointing scheme with our new one. In experiments, we compared the overhead of the new scheme to that of JFT_GLB, with UTS, BC and two synthetic benchmarks. The new scheme required slightly more running time when local pools were small, and paid off otherwise.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128536605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Castaño, J. Cuenca, José-Matías Cutillas-Lozano, D. Giménez, J. López-Espín, A. Pérez-Bernabeu
{"title":"Parallelism on Hybrid Metaheuristics for Vector Autoregression Models","authors":"A. Castaño, J. Cuenca, José-Matías Cutillas-Lozano, D. Giménez, J. López-Espín, A. Pérez-Bernabeu","doi":"10.1109/HPCS.2018.00134","DOIUrl":"https://doi.org/10.1109/HPCS.2018.00134","url":null,"abstract":"Vector Autoregression Models are multi-equation models that linearly describe the simultaneous interactions and behavior among a group of variables, using only their own past. They have been traditionally used in finance and econometrics, but, with the arrival of Big Data, huge amounts of data are being collected in numerous fields and their use for other fields is being considered. Tools are available for these models, but the huge amount of data makes it necessary to exploit High¬Performance Computing for the acceleration of methods to obtain the models. This paper considers a matrix formulation to represent time dependencies, and the solution of the optimization problem generated is approached through hybrid metaheuristics. The parameterized, parallel implementation of the metaheuristics and the matrix formulation ease the exploitation of multilevel shared-memory parallelism.","PeriodicalId":308138,"journal":{"name":"2018 International Conference on High Performance Computing & Simulation (HPCS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127370785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}