Suchergebnisse - "shared-memory multiprocessor"
-
1
Optimizing Sparse Linear Algebra for Large-Scale Graph Analytics
ISSN: 0018-9162, 1558-0814Veröffentlicht: New York IEEE 01.08.2015Veröffentlicht in Computer (Long Beach, Calif.) (01.08.2015)“… Emerging data-intensive applications attempt to process and provide insight into vast amounts of online data. A new class of linear algebra algorithms can …”
Volltext
Journal Article -
2
A superlinear speedup region for matrix multiplication
ISSN: 1532-0626, 1532-0634Veröffentlicht: Blackwell Publishing Ltd 10.08.2014Veröffentlicht in Concurrency and computation (10.08.2014)“… SUMMARYThe realization of modern processors is based on a multicore architecture with increasing number of cores per processor. Multicore processors are often …”
Volltext
Journal Article -
3
pPOP: Fast yet accurate parallel hierarchical clustering using partitioning
ISSN: 0169-023X, 1872-6933Veröffentlicht: Elsevier B.V 01.06.2007Veröffentlicht in Data & knowledge engineering (01.06.2007)“… Hierarchical agglomerative clustering (HAC) is very useful but due to high CPU time and memory complexity its practical use is limited. Earlier, we proposed an …”
Volltext
Journal Article -
4
Superlinear speedup for matrix multiplication
ISBN: 1467316296, 9781467316293ISSN: 1334-2762Veröffentlicht: IEEE 01.06.2012Veröffentlicht in Proceedings of the ITI 2012 34th International Conference on Information Technology Interfaces (01.06.2012)“… Amdahl has shown that multiprocessor execution performance is not proportional to the number of processors. Gustafson has found a way to show that there are …”
Volltext
Tagungsbericht -
5
Data partitioning-based parallel irregular reductions
ISSN: 1532-0626, 1532-0634Veröffentlicht: Chichester, UK John Wiley & Sons, Ltd 01.02.2004Veröffentlicht in Concurrency and computation (01.02.2004)“… Different parallelization methods for irregular reductions on shared memory multiprocessors have been proposed in the literature in recent years. We have …”
Volltext
Journal Article -
6
Parallel algorithms for LU decomposition on a shared memory multiprocessor
ISSN: 0096-3003, 1873-5649Veröffentlicht: New York, NY Elsevier Inc 05.04.2005Veröffentlicht in Applied mathematics and computation (05.04.2005)“… In this work, we present the numerical results (using C++) obtained from seven different versions of the LU decomposition algorithms. Four of the algorithms …”
Volltext
Journal Article -
7
Parallel recombinative simulated annealing: A genetic algorithm
ISSN: 0167-8191, 1872-7336Veröffentlicht: Amsterdam Elsevier B.V 1995Veröffentlicht in Parallel computing (1995)“… This paper introduces and analyzes a parallel method of simulated annealing. Borrowing from genetic algorithms, an effective combination of simulated annealing …”
Volltext
Journal Article -
8
Integrated Memory Controllers with Parallel Coherence Streams
ISSN: 1045-9219, 1558-2183Veröffentlicht: New York IEEE 01.08.2007Veröffentlicht in IEEE transactions on parallel and distributed systems (01.08.2007)“… Previous work in scalable hardware distributed shared memory (DSM) multiprocessors has established the critical and dominant role that protocol processing …”
Volltext
Journal Article -
9
Trapezoid self-scheduling: a practical scheduling scheme for parallel compilers
ISSN: 1045-9219Veröffentlicht: IEEE 01.01.1993Veröffentlicht in IEEE transactions on parallel and distributed systems (01.01.1993)“… A practical processor self-scheduling scheme, trapezoid self-scheduling, is proposed for arbitrary parallel nested loops in shared-memory multiprocessors …”
Volltext
Journal Article -
10
Comments on parallel algorithms for the knapsack problem
ISSN: 0167-8191, 1872-7336Veröffentlicht: Elsevier B.V 01.10.2002Veröffentlicht in Parallel computing (01.10.2002)“… Chang et al. [Parallel Comput. (1994) 233] introduced a parallel algorithm based on a shared memory SIMD architecture for the generation phase of the classic …”
Volltext
Journal Article -
11
Implementing a dynamic processor allocation policy for multiprogrammed parallel applications in the SolarisTM
ISSN: 1532-0626, 1532-0634Veröffentlicht: Chichester, UK John Wiley & Sons, Ltd 01.05.2001Veröffentlicht in Concurrency and computation (01.05.2001)“… Parallel applications typically do not perform well in a multiprogrammed environment that uses time‐sharing to allocate processor resources to the …”
Volltext
Journal Article -
12
A unified formalization of four shared-memory models
ISSN: 1045-9219Veröffentlicht: Los Alamitos, CA IEEE 01.06.1993Veröffentlicht in IEEE transactions on parallel and distributed systems (01.06.1993)“… The authors present a data-race-free-1, shared-memory model that unifies four earlier models: weak ordering, release consistency (with sequentially consistent …”
Volltext
Journal Article -
13
Performance evaluation of delayed-committing transactional memory
Veröffentlicht: IEEE 01.06.2017Veröffentlicht in 2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) (01.06.2017)“… Transactional memory (TM) is promising to make parallel programming easier. Many hardware implementations of transactional memory (HTM) have been proposed to …”
Volltext
Tagungsbericht -
14
Analytic evaluation of shared-memory architectures
ISSN: 1045-9219, 1558-2183Veröffentlicht: New York IEEE 01.02.2003Veröffentlicht in IEEE transactions on parallel and distributed systems (01.02.2003)“… This paper develops and validates an efficient analytical model for evaluating the performance of shared memory architectures with ILP processors. First, we …”
Volltext
Journal Article -
15
Speculative memory: An architectural support for explicit speculations in multithreaded programming
Veröffentlicht: IEEE 01.06.2016Veröffentlicht in 2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS) (01.06.2016)“… We have been developing a multiprocessor architecture which executes iterations of a loop speculatively in parallel. In this paper, we present speculative …”
Volltext
Tagungsbericht -
16
A new approach for the verification of cache coherence protocols
ISSN: 1045-9219Veröffentlicht: Los Alamitos, CA IEEE 01.08.1995Veröffentlicht in IEEE transactions on parallel and distributed systems (01.08.1995)“… We introduce a cache protocol verification technique based on a symbolic state expansion procedure. A global Finite State Machine (FSM) model characterizing …”
Volltext
Journal Article -
17
Implementing a dynamic processor allocation policy for multiprogrammed parallel applications in the Solaris[trademark] operating system
ISSN: 1532-0626Veröffentlicht: 01.05.2001Veröffentlicht in Concurrency and computation (01.05.2001)“… Parallel applications typically do not perform well in a multiprogrammed environment that uses time-sharing to allocate processor resources to the …”
Volltext
Journal Article -
18
On the Correctness of Program Execution When Cache Coherence Is Maintained Locally at Data-Sharing Boundaries in Distributed Shared Memory Multiprocessors
ISSN: 0885-7458, 1573-7640Veröffentlicht: New York Springer Nature B.V 01.10.2004Veröffentlicht in International journal of parallel programming (01.10.2004)“… Emerging multiprocessor architectures such as chip multiprocessors, embedded architectures, and massively parallel architectures, demand faster, more …”
Volltext
Journal Article -
19
Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem
ISSN: 0926-6003, 1573-2894Veröffentlicht: New York Springer Nature B.V 01.02.2001Veröffentlicht in Computational optimization and applications (01.02.2001)“… In this paper we deal with the solution of the separable convex cost network flow problem. In particular, we propose a parallel asynchronous version of the …”
Volltext
Journal Article -
20
Dynamically adapting to system load and program behavior in multiprogrammed multiprocessor systems
ISSN: 1532-0626, 1532-0634Veröffentlicht: Chichester, UK John Wiley & Sons, Ltd 01.10.2002Veröffentlicht in Concurrency and computation (01.10.2002)“… Parallel execution of application programs on a multiprocessor system may lead to performance degradation if the workload of a parallel region is not large …”
Volltext
Journal Article

