Researchers have developed a wide variety of methods for string data, that can be applied with success in different fields such as computational biology, natural language processing and so on. Such methods range from clustering techniques used to analyze the phylogenetic trees of different organisms, to kernel methods used to identify authorship or native language from text. Results of such methods are not perfect and can always be improved. Some of these methods are based on a distance or similarity measure for strings, such as Hamming, Levenshtein, Kendall-tau, rank distance, or string kernel. This paper aims to introduce a new distance measure, termed Local Rank Distance (LRD), inspired from the recently introduced Local Patch Dissimilarity for images. Designed to conform to more general principles and adapted to DNA strings, LRD comes to improve over state of the art methods for phylogenetic analysis. This paper shows two applications of LRD. The first application is the phylogenetic analysis of mammals. Experiments show that phylogenetic trees produced by LRD are better or at least similar to those reported in the literature. The second application is to identify native language of English learners. By working at character level, the proposed method is completely language independent and theory neutral. In conclusion, LRD can be used as a general approach to measure string similarity, despite being designed for DNA.
{"title":"Local Rank Distance","authors":"Radu Tudor Ionescu","doi":"10.1109/SYNASC.2013.36","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.36","url":null,"abstract":"Researchers have developed a wide variety of methods for string data, that can be applied with success in different fields such as computational biology, natural language processing and so on. Such methods range from clustering techniques used to analyze the phylogenetic trees of different organisms, to kernel methods used to identify authorship or native language from text. Results of such methods are not perfect and can always be improved. Some of these methods are based on a distance or similarity measure for strings, such as Hamming, Levenshtein, Kendall-tau, rank distance, or string kernel. This paper aims to introduce a new distance measure, termed Local Rank Distance (LRD), inspired from the recently introduced Local Patch Dissimilarity for images. Designed to conform to more general principles and adapted to DNA strings, LRD comes to improve over state of the art methods for phylogenetic analysis. This paper shows two applications of LRD. The first application is the phylogenetic analysis of mammals. Experiments show that phylogenetic trees produced by LRD are better or at least similar to those reported in the literature. The second application is to identify native language of English learners. By working at character level, the proposed method is completely language independent and theory neutral. In conclusion, LRD can be used as a general approach to measure string similarity, despite being designed for DNA.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122121067","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}
This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty involved with each job if it is processed earlier or later than the due date. The objective of the problem is to find the assignment of jobs to machines, the processing sequence of jobs and the time at which they are processed, which minimizes the total penalty incurred due to tardiness or earliness of the jobs. This work presents exact polynomial algorithms for optimizing a given job sequence for single and parallel machines with the run-time complexities of O(n log n) and O(mn2 log n) respectively, where n is the number of jobs and m the number of machines. The algorithms take a sequence consisting of all the jobs (Ji, i = 1,2,...,n) as input and distribute the jobs to machines (for m>1) along with their best completion times so as to get the least possible total penalty for this sequence. We prove the optimality for the single machine case and the runtime complexities of both. Henceforth, we present the results for the benchmark problems and compare with previous work for both single and parallel machine cases, up to 200 jobs.
研究了单并行机器上作业的调度问题，其中所有作业具有不同的加工时间，但有一个共同的到期日。如果每项工作的处理时间早于或晚于截止日期，则会受到处罚。该问题的目标是找到分配给机器的作业，作业的加工顺序和加工时间，以最小化由于延迟或提前作业而产生的总损失。这项工作提出了精确的多项式算法，用于优化单个和并行机器的给定作业序列，其运行时复杂度分别为O(n log n)和O(mn2 log n)，其中n是作业数量，m是机器数量。该算法采用由所有作业(Ji, i = 1,2，…，n)组成的序列作为输入，并将作业分配给机器(对于m>1)以及它们的最佳完成时间，以便对该序列获得尽可能小的总惩罚。我们证明了单机情况下的最优性和两者的运行时复杂性。此后，我们给出了基准问题的结果，并将其与以前的单机和并机案例进行了比较，最多可达200个作业。
{"title":"Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence","authors":"A. Awasthi, Jörg Lässig, Oliver Kramer","doi":"10.1109/SYNASC.2013.41","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.41","url":null,"abstract":"This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty involved with each job if it is processed earlier or later than the due date. The objective of the problem is to find the assignment of jobs to machines, the processing sequence of jobs and the time at which they are processed, which minimizes the total penalty incurred due to tardiness or earliness of the jobs. This work presents exact polynomial algorithms for optimizing a given job sequence for single and parallel machines with the run-time complexities of O(n log n) and O(mn2 log n) respectively, where n is the number of jobs and m the number of machines. The algorithms take a sequence consisting of all the jobs (Ji, i = 1,2,...,n) as input and distribute the jobs to machines (for m>1) along with their best completion times so as to get the least possible total penalty for this sequence. We prove the optimality for the single machine case and the runtime complexities of both. Henceforth, we present the results for the benchmark problems and compare with previous work for both single and parallel machine cases, up to 200 jobs.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127047725","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}
Maintaining arc-consistency during the search is one of the most widely used techniques in solving constraint satisfaction problems. Many algorithms have been developed in order to implement effectively arc-consistency, such as AC-3, AC-4, AC-6 or AC-7. While not as elaborate as others, AC-3 is simple to implement and proves to be efficient for many types of problems. In order to improve the overall performance of an AC-3 based solver it is essential to exploit any specific feature of the problem being solved. In this paper we describe a generic method to reduce the number of useless revisions performed by AC-3 based on the semantics of the constraints, as long as they provide custom information needed by our algorithm. Arithmetic constraints of the form ax + by ? c where x, y are variables of the constraint network, a,b,c are integer values and the operator ? ? {} fit naturally into this framework and AC3-OP becomes a particular case of our algorithm.
{"title":"Reducing the Number of Useless Revisions Performed by Constraint Solvers Based on AC-3","authors":"Cristian Frasinaru, E. F. Olariu","doi":"10.1109/SYNASC.2013.39","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.39","url":null,"abstract":"Maintaining arc-consistency during the search is one of the most widely used techniques in solving constraint satisfaction problems. Many algorithms have been developed in order to implement effectively arc-consistency, such as AC-3, AC-4, AC-6 or AC-7. While not as elaborate as others, AC-3 is simple to implement and proves to be efficient for many types of problems. In order to improve the overall performance of an AC-3 based solver it is essential to exploit any specific feature of the problem being solved. In this paper we describe a generic method to reduce the number of useless revisions performed by AC-3 based on the semantics of the constraints, as long as they provide custom information needed by our algorithm. Arithmetic constraints of the form ax + by ? c where x, y are variables of the constraint network, a,b,c are integer values and the operator ? ? {} fit naturally into this framework and AC3-OP becomes a particular case of our algorithm.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117232283","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}
Traditionally, message oriented middlewares (MOM) are looked upon as either centralized systems (e.g. AMQP) or a rigidly distributed collection of machines, requiring significant configuration overhead for achieving the desired throughput under the needed security constraints. On the other end of the spectrum, peer-to-peer systems (P2P) in general achieve amazing scalability and fault tolerance, but due to their very nature, are susceptible to various attacks. Since all measures of security have considerable consequences on the system's capabilities, the securing of a peer-to-peer system requires a thorough analysis on the exact designated use-case and environment in which the network is required to operate in, as well as all the possible threats the system must be able to withstand. The paper proposes a security model that bridges the distribution concept of peer-to-peer systems with the necessities of MOMs by rigorously defining the operational environment, assumptions and requirements, on top of which a security protocol was implemented. Taking advantage of the specific use case of P2P MOMs, further optimizations are provided which provide the same security against the defined threat model, but result in significant gains with regard to the overall switching throughput of the network.
{"title":"Securing Communication in a Peer-to-Peer Messaging Middleware","authors":"Péter Szilágyi","doi":"10.1109/SYNASC.2013.50","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.50","url":null,"abstract":"Traditionally, message oriented middlewares (MOM) are looked upon as either centralized systems (e.g. AMQP) or a rigidly distributed collection of machines, requiring significant configuration overhead for achieving the desired throughput under the needed security constraints. On the other end of the spectrum, peer-to-peer systems (P2P) in general achieve amazing scalability and fault tolerance, but due to their very nature, are susceptible to various attacks. Since all measures of security have considerable consequences on the system's capabilities, the securing of a peer-to-peer system requires a thorough analysis on the exact designated use-case and environment in which the network is required to operate in, as well as all the possible threats the system must be able to withstand. The paper proposes a security model that bridges the distribution concept of peer-to-peer systems with the necessities of MOMs by rigorously defining the operational environment, assumptions and requirements, on top of which a security protocol was implemented. Taking advantage of the specific use case of P2P MOMs, further optimizations are provided which provide the same security against the defined threat model, but result in significant gains with regard to the overall switching throughput of the network.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123004602","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}
We consider LU factoring of matrices in the context of exact and symbolic computation, as opposed to floating-point computation. Although initially developed for Gaussian elimination, fraction-free methods have been extended to LU factoring and related forms. We present surprising evidence that the rows and columns of the three matrices in the fraction-free form contain more common factors than one would expect. We describe and analyze experimental evidence for the existence of common factors, both in the case of integer matrices and matrices containing polynomials. The factors discovered grow linearly in the size of the matrix being factored. The common factors allow the entries in the factored form to be decreased in size.
{"title":"Common Factors in Fraction-Free Matrix Reduction","authors":"J. Middeke, Ahmed Almohaimeed, D. J. Jeffrey","doi":"10.1109/SYNASC.2013.17","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.17","url":null,"abstract":"We consider LU factoring of matrices in the context of exact and symbolic computation, as opposed to floating-point computation. Although initially developed for Gaussian elimination, fraction-free methods have been extended to LU factoring and related forms. We present surprising evidence that the rows and columns of the three matrices in the fraction-free form contain more common factors than one would expect. We describe and analyze experimental evidence for the existence of common factors, both in the case of integer matrices and matrices containing polynomials. The factors discovered grow linearly in the size of the matrix being factored. The common factors allow the entries in the factored form to be decreased in size.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123892155","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}
Stefan Meyer, Philip D. Healy, Theo Lynn, J. Morrison
Commonly used open source configuration management systems, such as Puppet, Chef and CFEngine, allow for system configurations to be expressed as scripts. A number of quality issues that may arise when executing these scripts are identified. An automated quality assurance service is proposed that identifies the presence of these issues by automatically executing scripts across a range of environments. Test results are automatically published to a format capable of being consumed by script catalogues and social coding sites. This would serve as an independent signal of script trustworthiness and quality to script consumers and would allow developers to be made quickly aware of quality issues. As a result, potential consumers of scripts can be assured that a script is likely to work when applied to their particular environment. Script developers can be notified of compatibility issues and take steps to address them.
{"title":"Quality Assurance for Open Source Software Configuration Management","authors":"Stefan Meyer, Philip D. Healy, Theo Lynn, J. Morrison","doi":"10.1109/SYNASC.2013.66","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.66","url":null,"abstract":"Commonly used open source configuration management systems, such as Puppet, Chef and CFEngine, allow for system configurations to be expressed as scripts. A number of quality issues that may arise when executing these scripts are identified. An automated quality assurance service is proposed that identifies the presence of these issues by automatically executing scripts across a range of environments. Test results are automatically published to a format capable of being consumed by script catalogues and social coding sites. This would serve as an independent signal of script trustworthiness and quality to script consumers and would allow developers to be made quickly aware of quality issues. As a result, potential consumers of scripts can be assured that a script is likely to work when applied to their particular environment. Script developers can be notified of compatibility issues and take steps to address them.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117329178","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}
E. D. Nitto, M. A. D. Silva, D. Ardagna, G. Casale, Ciprian Craciun, Nicolas Ferry, Victor Muntés, Arnor Solberg
Vendor lock-in and cloud outages are two important challenges that make IT managers reluctant in widely adopting the cloud within the enterprise. Vendor lock-in happens when the adoption of cloud provider-specific technologies and APIs forces consumers to stay with the same provider even if they would like to change. Cloud outages can happen to any provider, as the events of the last years have largely demonstrated, and have a critical impact on the actual reliability of cloud applications. A solution to both problems could be to support application developers and operators in the adoption of a multi-cloud approach: applications are built to run and replicate on different clouds, and mechanisms for fast switching from a cloud installation to the other are offered. In the MODAClouds project we pursue this approach and rely on model-driven development combined with risk analysis and quality prediction. In this paper we provide an overview of our approach and present the architecture of the corresponding platform.
{"title":"Supporting the Development and Operation of Multi-cloud Applications: The MODAClouds Approach","authors":"E. D. Nitto, M. A. D. Silva, D. Ardagna, G. Casale, Ciprian Craciun, Nicolas Ferry, Victor Muntés, Arnor Solberg","doi":"10.1109/SYNASC.2013.61","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.61","url":null,"abstract":"Vendor lock-in and cloud outages are two important challenges that make IT managers reluctant in widely adopting the cloud within the enterprise. Vendor lock-in happens when the adoption of cloud provider-specific technologies and APIs forces consumers to stay with the same provider even if they would like to change. Cloud outages can happen to any provider, as the events of the last years have largely demonstrated, and have a critical impact on the actual reliability of cloud applications. A solution to both problems could be to support application developers and operators in the adoption of a multi-cloud approach: applications are built to run and replicate on different clouds, and mechanisms for fast switching from a cloud installation to the other are offered. In the MODAClouds project we pursue this approach and rely on model-driven development combined with risk analysis and quality prediction. In this paper we provide an overview of our approach and present the architecture of the corresponding platform.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115790618","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}
Computational fluid dynamics (CFD) simulations require a lot of computing resources in terms of CPU time and memory in order to compute with a reasonable physical accuracy. If only uniformly refined domains are applied, the amount of computing cells is growing rather fast if a certain small resolution is physically required. This can be remedied by applying adaptively refined grids. Unfortunately, due to the adaptive refinement procedures, errors are introduced which have to be taken into account. This paper is focussing on implementation details of the applied adaptive data structure management and a qualitative analysis of the introduced errors by analysing a Poisson problem on the given data structure, which has to be solved in every time step of a CFD analysis. Furthermore an adaptive CFD benchmark example is computed, showing the benefits of an adaptive refinement as well as measurements of parallel data distribution and performance.
{"title":"Adaptive Distributed Data Structure Management for Parallel CFD Applications","authors":"J. Frisch, R. Mundani, E. Rank","doi":"10.1109/SYNASC.2013.73","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.73","url":null,"abstract":"Computational fluid dynamics (CFD) simulations require a lot of computing resources in terms of CPU time and memory in order to compute with a reasonable physical accuracy. If only uniformly refined domains are applied, the amount of computing cells is growing rather fast if a certain small resolution is physically required. This can be remedied by applying adaptively refined grids. Unfortunately, due to the adaptive refinement procedures, errors are introduced which have to be taken into account. This paper is focussing on implementation details of the applied adaptive data structure management and a qualitative analysis of the introduced errors by analysing a Poisson problem on the given data structure, which has to be solved in every time step of a CFD analysis. Furthermore an adaptive CFD benchmark example is computed, showing the benefits of an adaptive refinement as well as measurements of parallel data distribution and performance.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"467 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116184819","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}
In this paper, we try to build a bridge between pure theoretical approach to computations on decomposable graphs and heuristics, used in practice for treatment of particular cases of them. In theory, Feferman and Vaught in 1959 proposed a method to reduce solution of First Order definable problems on Disjoint Union of structures to solutions of derived problems on the components with some post-processing of the obtained results. In practice, the literature is very reach in examples of particular methods to deal with different variations of graphs, built from components. From the theoretical point of view we adapt and generalize the Feferman-Vaught method. We define a new kind of decomposable graphs: sum-like graphs and propose a new systematic approach, which allows us to reduce the solution of Monadic Second Order definable problems on such graphs to the solution of effectively derivable Monadic Second Order definable problems on the components. From the practical point of view, we consider in great details one application of our approach in the field of parallel computations on distributed data.
{"title":"A Systematic Approach to Computations on Decomposable Graphs","authors":"E. Ravve, Z. Volkovich","doi":"10.1109/SYNASC.2013.59","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.59","url":null,"abstract":"In this paper, we try to build a bridge between pure theoretical approach to computations on decomposable graphs and heuristics, used in practice for treatment of particular cases of them. In theory, Feferman and Vaught in 1959 proposed a method to reduce solution of First Order definable problems on Disjoint Union of structures to solutions of derived problems on the components with some post-processing of the obtained results. In practice, the literature is very reach in examples of particular methods to deal with different variations of graphs, built from components. From the theoretical point of view we adapt and generalize the Feferman-Vaught method. We define a new kind of decomposable graphs: sum-like graphs and propose a new systematic approach, which allows us to reduce the solution of Monadic Second Order definable problems on such graphs to the solution of effectively derivable Monadic Second Order definable problems on the components. From the practical point of view, we consider in great details one application of our approach in the field of parallel computations on distributed data.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130333768","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}
The problem of visualization of very large sparse matrices emerging on massively parallel computer systems is identified and a new method along with an accompanying algorithm for parallel acquisition of visualization data for such matrices are presented. The proposed method is based on downsampling a matrix into blocks for which the desired visualization data are saved into a file. This file is then supposed to be downloaded and processed into a final image on a personal computer. Experimental results for the evaluation of the performance and scalability of the proposed algorithm are further provided and discussed.
{"title":"Parallel data acquisition for visualization of very large sparse matrices","authors":"D. Langr, I. Šimeček, P. Tvrdík, T. Dytrych","doi":"10.1109/SYNASC.2013.51","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.51","url":null,"abstract":"The problem of visualization of very large sparse matrices emerging on massively parallel computer systems is identified and a new method along with an accompanying algorithm for parallel acquisition of visualization data for such matrices are presented. The proposed method is based on downsampling a matrix into blocks for which the desired visualization data are saved into a file. This file is then supposed to be downloaded and processed into a final image on a personal computer. Experimental results for the evaluation of the performance and scalability of the proposed algorithm are further provided and discussed.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131131266","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：