ACM Home Page

Searching within The Guide for: PrimaryCCS:D13  (start a new search)

Found 2,994 of 1,394,228

REFINE YOUR SEARCH

ADVANCED SEARCH
Advanced search.  Advanced Search

FEEDBACK
Please provide us with feedback. Please provide us with feedback

Found 2,994 of 1,394,228

Results 1 - 20 of 2,994
Sort by in
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>
1
A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI
February 1990
PPOPP '90: Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (1.05 MB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 5,   Downloads (12 Months): 25,   Downloads (Overall): 259,    Citation Count: 12

Good load balancing is the key to deriving maximal performance from multiprocessors. Several successful dynamic load balancing techniques on tightly-coupled multiprocessors have been developed. However, load balancing is more difficult on loosely-coupled ...


Also published in:
March 1990 SIGPLAN Notices Volume 25 Issue 3
2
Parallelism in multigrid methods: how much is too much?
October 1996
International Journal of Parallel Programming , Volume 24 Issue 5
Publisher: Kluwer Academic Publishers
Additional Information:full citation, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1

Keywords: Parallel multigrid methods, models of parallel computation, parallel computers
3
Software and the Concurrency Revolution
September 2005
Queue , Volume 3 Issue 7
Publisher: ACM Request Permissions Request Permissions   
Full text available: HtmlHtml (36.41 KB),  PdfPdf (275.37 KB)
Additional Information:full citation, abstract, references, cited by, index terms, review
Bibliometrics:  Downloads (6 Weeks): 694,   Downloads (12 Months): 2978,   Downloads (Overall): 4507,    Citation Count: 24

Leveraging the full power of multicore processors demands new tools and new thinking from the software industry.
Concurrency has long been touted as the "next big thing" and "the way of the future," but for the past 30 years, mainstream software development ...

4
ThreadMentor: a pedagogical tool for multithreaded programming
March 2003
Journal on Educational Resources in Computing (JERIC) , Volume 3 Issue 1
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (438.28 KB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 23,   Downloads (12 Months): 114,   Downloads (Overall): 1401,    Citation Count: 5

ThreadMentor is a multiplatform pedagogical tool designed to ease the difficulty in teaching and learning multithreaded programming. It consists of a C++ class library and a visualization system. The class library supports many thread management functions ...


Keywords: multithreaded programming, synchronization, synchronization primitives, threads, visualization
5
International Journal of Parallel Programming: Volume 21 Issue 4
August 1992
International Journal of Parallel Programming
Publisher: Kluwer Academic Publishers
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
6
Partitioning finite element meshes using space-filling curves
May 2005
Future Generation Computer Systems , Volume 21 Issue 5
Publisher: Elsevier Science Publishers B. V.
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 1

Using space-filling curves to partition unstructured finite element meshes is a widely applied strategy when it comes to distributing load among several computation nodes. Compared to more elaborated graph partitioning packages, this geometric approach ...


Keywords: distributed finite element method, graph partitioning, space-filling curves
7
A parallel finite state machine implementation of a nearest-eight Hoshen-Kopelman adaptation for landscape analysis
March 2007
ACM-SE 45: Proceedings of the 45th annual southeast regional conference
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (90.85 KB)
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): 3,   Downloads (12 Months): 20,   Downloads (Overall): 79,    Citation Count: 0

This paper describes preliminary work on a parallel finite state machine implementation of the Hoshen-Kopelman cluster identification algorithm. While the original Hoshen-Kopelman algorithm applies the classic NEWS neighborhood function to determine ...


Keywords: Hoshen-Kopelman, finite state machines, landscape analysis, parallelization
8
Synthesis of concurrent systems for an atomic read/atomic write model of computation
May 1996
PODC '96: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (943.05 KB)
Additional Information:full citation, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Downloads (Overall): 108,    Citation Count: 3
9
A Data Parallel Programming Model Based on Distributed Objects
September 2002
CLUSTER '02: Proceedings of the IEEE International Conference on Cluster Computing
Publisher: IEEE Computer Society
Full text available: Publisher SitePublisher Site
Additional Information:full citation, abstract, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

This paper proposes a data parallel programming model suitable for loosely synchronous, irregular applications. At the core of the model are distributed objects that express non-trivial data parallelism. Sequential objects express in-dependent computations.The ...

10
Concurrency and Computation: Practice & Experience: Volume 18 Issue 12
October 2006
Concurrency and Computation: Practice & Experience
Publisher: John Wiley and Sons Ltd.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
11
Characterization of workloads for distributed DB/DC-processing
March 1997
Information Sciences: an International Journal , Volume 97 Issue 1-2
Publisher: Elsevier Science Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
12
Checking automatically the output of concurrent threads
June 2007
ITiCSE '07: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (285.10 KB)
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): 5,   Downloads (12 Months): 25,   Downloads (Overall): 139,    Citation Count: 2

Assessing automatically students' solutions to concurrent programming assignments by looking at the produced output is a crucial and error-prone task. On the one hand a student's program may coincidentally produce a correct output although the program ...


Keywords: automatic software assessment, causal relationship, semaphores, vector timestamps, visualization

Also published in:
June 2007 SIGCSE Bulletin Volume 39 Issue 3
13
Register allocation with instruction scheduling
August 1993
PLDI '93: Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (931.91 KB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 8,   Downloads (12 Months): 55,   Downloads (Overall): 465,    Citation Count: 29

We present a new framework in which considerations of both register allocation and instruction scheduling can be applied uniformly and simultaneously. In this framework an optimal coloring of a graph, called the parallel interference graph, ...


Also published in:
June 1993 SIGPLAN Notices Volume 28 Issue 6
14
Analysis of event synchronization in a parallel programming tool
February 1990
PPOPP '90: Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (1.15 MB)
Additional Information:full citation, abstract, references, cited by, index terms
Bibliometrics:  Downloads (6 Weeks): 4,   Downloads (12 Months): 46,   Downloads (Overall): 241,    Citation Count: 30

Understanding synchronization is important for a parallel programming tool that uses dependence analysis as the basis for advising programmers on the correctness of parallel constructs. This paper discusses static analysis methods that can be applied ...


Also published in:
March 1990 SIGPLAN Notices Volume 25 Issue 3
15
Interoperability of data parallel runtime libraries with meta-chaos
May 1996
Interoperability of data parallel runtime libraries with meta-chaos
Publisher: University of Maryland at College Park
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
16
Parallel and distributed local search in COMET
August 2009
Computers and Operations Research , Volume 36 Issue 8
Publisher: Elsevier Science Ltd.
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

The availability of commodity multiprocessors and high-speed networks of workstations offer significant opportunities for addressing the increasing computational requirements of optimization applications. To leverage these potential benefits, it is important, ...


Keywords: Combinatorial optimization, Constraint programming, Distributed, Language, Local search, Parallel
17
Understanding the programming techniques for client-server architectures
February 1996
SEHE '95: Proceedings of the second international conference on Software engineering in higher education II
Publisher: Computational Mechanics, Inc.
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0
18
Path analysis of distributed programs
February 1988
CSC '88: Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (1.05 MB)
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): 0,   Downloads (12 Months): 6,   Downloads (Overall): 127,    Citation Count: 0

Experiment planning for any practical application of a distributed system needs a selection of test cases which have to represent distinct system behaviours; these test cases must next be performed by the system in its run-time environment. For a single ...

19
Enhanced co-scheduling: a software pipelining method using modulo-scheduled pipeline theory
February 2000
International Journal of Parallel Programming , Volume 28 Issue 1
Publisher: Plenum Press
Additional Information:full citation, index terms
Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Downloads (Overall): n/a,    Citation Count: 0

Keywords: VLIW/superscalar architectures, classical pipeline theory, co-scheduling, instruction-level parallelism, software pipelining
20
The complexity of obstruction-free implementations
June 2009
Journal of the ACM (JACM) , Volume 56 Issue 4
Publisher: ACM Request Permissions Request Permissions   
Full text available: PdfPdf (524.57 KB)
Additional Information:full citation, abstract, references, index terms
Bibliometrics:  Downloads (6 Weeks): 18,   Downloads (12 Months): 175,   Downloads (Overall): 175,    Citation Count: 0

Obstruction-free implementations of concurrent objects are optimized for the common case where there is no step contention, and were recently advocated as a solution to the costs associated with synchronization without locks. In this article, ...


Keywords: Shared memory, lower bounds, memory contention, perturbable objects, solo-fast implementations, step contention
Result page: 1   2   3   4   5   6   7   8   9   10    next    >>