scispace - formally typeset
Search or ask a question
Topic

Degree of parallelism

About: Degree of parallelism is a research topic. Over the lifetime, 1515 publications have been published within this topic receiving 25546 citations.


Papers
More filters
Posted Content
TL;DR: This paper proposes TARS, a parallel log-recovery mechanism that is specifically designed for lightweight, coarse-grained command-logging approach, and yields significantly higher recovery rate without compromising the efficiency of transaction processing.
Abstract: Main-memory database systems for multicore servers can achieve excellent performance when processing massive volume of OLTP workloads. But crash-resilience mechanism, or namely loggingand-replay, can either degrade the performance of transaction processing or slow down the process of failure recovery. In this paper, we show that, by exploiting application semantics, it is possible to achieve speedy failure recovery without introducing any costly logging overhead to the execution of online transactions. We propose TARS, a parallel log-recovery mechanism that is specifically designed for lightweight, coarse-grained command-logging approach. TARS leverages a combination of static and dynamic analyses to parallelize the log replay: at compile time, TARS decomposes stored procedures by carefully analyzing dependencies within and across programs; at recovery time, a re-execution schedule with a high degree of parallelism is attained through lightweight one-pass scans over transaction parameter values. As such, recovery latency is remarkably minimized. We evaluated TARS in a main-memory database prototype running on a 40-core server. Compared to the state-of-the-art mechanisms, TARS yields significantly higher recovery rate without compromising the efficiency of transaction processing.

4 citations

Proceedings ArticleDOI
01 Dec 2017
TL;DR: It is concluded that the Map-Scan approach in defining the accelerator of a hybrid system provides the appropriate solution for accelerating various Big Data applications and linear algebra based applications.
Abstract: The current hybrid architectures, used to accelerate the nodes of the various distributed computing systems running Big Data applications, are mainly based on Nvidia's GPU or Intel's MIC accelerators. These accelerators are marked by limitations due to their too general and ad hoc structural and architectural features. In this paper, we propose a Map-Scan architecture, as a generalization of a Map-Reduce architecture, more appropriate for the parallel approach in defining the accelerator part of a hybrid system. The paper describes the organization and the architecture of a hybrid system based on our Map-Scan Accelerator (MSA). The degree of parallelism achieved by our proposal is compared with the current implementations. The energy consumption is estimated, by simulation, for the ASIC versions of MSA. We conclude that the Map-Scan approach in defining the accelerator of a hybrid system provides the appropriate solution for accelerating various Big Data applications and linear algebra based applications.

4 citations

01 Jan 2013
TL;DR: This paper introduces a novel method called PDCRP-method (Parallel and Distributed closed regular pattern) to discover closed regular patterns using vertical data format on large databases, which works at each local processor which reduces inter processor communication overhead and gets high degree of parallelism generates complete set ofclosed regular patterns.
Abstract: Due to huge increase in the records and dimensions of available databases pattern mining in large databases is a challenging problem. A good number of parallel and distributed FP mining algorithms have been proposed for large and distributed databases based on frequency of item set. Not only the frequency, regularity of item also can be considered as emerging factor in data mining research. Current days closed itemset mining has gained lot of attention in data mining research. So far some algorithms have been developed to mine regular patterns, there is no algorithm exists to mine closed regular patterns in parallel and distributed databases. In this paper we introduce a novel method called PDCRP-method (Parallel and Distributed closed regular pattern) to discover closed regular patterns using vertical data format on large databases. This method works at each local processor which reduces inter processor communication overhead and getting high degree of parallelism generates complete set of closed regular patterns. Our experimental results show that our PDCRP method is highly efficient in large databases.

4 citations

Proceedings ArticleDOI
16 Oct 2007
TL;DR: In this paper, a compiler infrastructure for the architecture is introduced in detail with discussion of how to support OpenMP APIs and how to integrate the Omni OpenMP compiler with the backend code generator.
Abstract: Embedded applications intrinsically have high degree of parallelism, but it is difficult to exploit the parallelism due to resource constraint of embedded platforms. In order to overcome the problem, we introduced a promising processor solution to support parallel thread execution with pretty good performance while consuming small hardware resources. We call this processor as Multithread Lockstep Execution Processor (MLEP). Since each iteration of parallel loops performs the same sequence of instructions at most time while manipulating different data, we only need to partially duplicate a pipeline resource to support the multithreading. This architecture makes it possible that parallel threads execute synchronously in a lockstep manner. However, because of providing a totally different kind of thread execution, it sometime makes programmers confused when parallelizing code for the processor. In this paper, we introduce a compiler infrastructure for our architecture in detail with discussion of how to support OpenMP APIs and how to integrate the Omni OpenMP compiler with our backend code generator. Also, for verification of our compiler system, we show that our code generation scheme delivers the same performance as handed codes.

4 citations

Proceedings ArticleDOI
24 Sep 2000
TL;DR: In this paper, the fundamental power balance between links, which is a basic limiting factor for both diversity action and parallelism, has been investigated at 2 GHz with a Doppler offset technique.
Abstract: Three element transmit (Tx) (at base station BS) by four element receive (Rx) (at portable unit PU) antenna systems have been investigated at 2 GHz. Simultaneous sounding of all 3Tx by 4Rx=12 parallel links has been performed using a Doppler offset technique. This allows for investigations of simultaneous Tx-Rx diversity effectiveness as well as support for disclosing the degree of parallelism (independent channels). The measurement main-lobe bandwidth is 8 MHz. This allowed a maximum range of approx. 2.5 km with 0.4 W Tx-power and 23 dBi total antenna gain. This paper focuses on the fundamental power balance between links, which is a basic limiting factor for both diversity action and parallelism.

4 citations


Network Information
Related Topics (5)
Server
79.5K papers, 1.4M citations
85% related
Scheduling (computing)
78.6K papers, 1.3M citations
83% related
Network packet
159.7K papers, 2.2M citations
80% related
Web service
57.6K papers, 989K citations
80% related
Quality of service
77.1K papers, 996.6K citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20221
202147
202048
201952
201870
201775