Author image not provided
 Paul A Martin

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article10.37
Citation Count197
Publication count19
Publication years1988-2014
Available for download9
Average downloads per article424.44
Downloads (cumulative)3,820
Downloads (12 Months)82
Downloads (6 Weeks)12
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


19 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 19 of 19
Sort by:

1
June 2014 Computational Mechanics: Volume 53 Issue 6, June 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Formulation of time-domain boundary element method for elastodynamic analysis of interaction between rigid massive disc-shaped inclusions subjected to impinging elastic waves is presented. Boundary integral equations (BIEs) with time-retarded kernels are obtained by using the integral representations of displacements in a matrix in terms of interfacial stress jumps across the ...
Keywords: Boundary element method, Disc-shaped rigid inclusions, Elastic matrix, Time-domain formulation, Inclusions interaction, Transient elastic wave

2
July 2007 Journal of Computational and Applied Mathematics: Volume 204 Issue 2, July, 2007
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

Acoustic scattering by bounded obstacles is considered, in both two and three dimensions. Relations between the T-matrix and the far-field pattern are derived, and then used to obtain new approximations for the T-matrix for small obstacles. The problem of scattering by a pair of small sound-soft circular cylinders is also ...
Keywords: 43.20.Fn, Acoustics, Low-frequency asymptotics, T-matrix, Bipolar coordinates

3 published by ACM
May 2005 ACM Transactions on Computer Systems (TOCS): Volume 23 Issue 2, May 2005
Publisher: ACM
Bibliometrics:
Citation Count: 30
Downloads (6 Weeks): 3,   Downloads (12 Months): 36,   Downloads (Overall): 1,277

Full text available: PDFPDF
Conventional dynamic memory management methods interact poorly with lock-free synchronization. In this article, we introduce novel techniques that allow lock-free data structures to allocate and free memory dynamically using any thread-safe memory management library. Our mechanisms are lock-free in the sense that they do not allow a thread to be ...
Keywords: Multiprocessors, dynamic data structures, memory management, nonblocking synchronization, concurrent data structures

4 published by ACM
June 2004 SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 23
Downloads (6 Weeks): 2,   Downloads (12 Months): 18,   Downloads (Overall): 609

Full text available: PDFPDF
Despite years of research, the design of efficient nonblocking algorithms remains difficult. A key reason is that current shared-memory multiprocessor architectures support only single-location synchronisation primitives such as compare-and-swap (CAS) and load-linked/store-conditional (LL/SC). Recently researchers have investigated the utility of double-compare-and-swap (DCAS)--a generalisation of CAS that supports atomic access to ...
Keywords: double-compare-and-swap, lock-free, nonblocking synchronization, concurrent data structures, DCAS, multiprocessors, linked lists

5
December 2002 Distributed Computing - Special issue: Selected papers from PODC '01: Volume 15 Issue 4, December 2002
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 17

Assuming the existence of garbage collection makes it easier to design implementations of dynamic-sized concurrent data structures. However, this assumption limits their applicability. We present a methodology that, for a significant class of data structures, allows designers to first tackle the easier problem of designing a garbage-collection-dependent implementation, and then ...
Keywords: memory management, reference counting, dynamic data structures, lockfree synchronization

6 published by ACM
July 2002 PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Downloads (Overall): 314

Full text available: PDFPDF

7
January 2002
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 1,   Downloads (Overall): 14

Full text available: PdfPdf
We address the problem of integrating lockfree shared data structures with standard dynamic allocation mechanisms (such as malloc and free). We have two main contributions. The first is the design and experimental analysis of two dynamic-sized lockfree FIFO queue implementations, which extend Michael and Scott's previous implementation by allowing unused ...

8
January 2002
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 18

Full text available: PdfPdf
We present a lock-free implementation of a dynamically sized double-ended queue (deque) that is based on the double compare-and-swap (DCAS) instruction. This implementation improves over the best previous one by allowing storage to be allocated and freed in bulk when the size of the deque changes significantly, and to avoid ...

9 published by ACM
August 2001 PODC '01: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 34
Downloads (6 Weeks): 3,   Downloads (12 Months): 14,   Downloads (Overall): 724

Full text available: PDFPDF
Assuming the existence of garbage collection makes it easier to design implementations of concurrent data structures. However, this assumption limits their applicability. We present a methodology that, for a significant class of data structures, allows designers to first tackle the easier problem of designing a garbage-collection-dependent implementation, and then apply ...

10
October 2000 DISC '00: Proceedings of the 14th International Conference on Distributed Computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 27

The computer industry is examining the use of strong synchronization operations such as double compare-and-swap (DCAS) as a means of supporting non-blocking synchronization on tomorrow's multiprocessor machines. However, before such a primitive will be incorporated into hardware design, its utility needs to be proven by developing a body of effective ...

11 published by ACM
July 2000 SPAA '00: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 12
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 337

Full text available: PDFPDF
The computer industry is currently examining the use of strong synchronization operations such as double compare-and-swap (DCAS) as a means of supporting non-blocking synchronization on tomorrow's multiprocessor machines. However, before such a strong primitive will be incorporated into hardware design, its utility needs to be proven by developing a body ...

12
April 2000 ANLC '00: Proceedings of the sixth conference on Applied natural language processing
Publisher: Association for Computational Linguistics
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 2,   Downloads (12 Months): 8,   Downloads (Overall): 370

Full text available: PDFPDF
This paper describes the results of some experiments using a new approach to information access that combines techniques from natural language processing and knowledge representation with a penalty-based technique for relevance estimation and passage retrieval. Unlike many attempts to combine natural language processing with information retrieval, these results show substantial ...

13
December 1999
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 1,   Downloads (Overall): 37

Full text available: PdfPdf
This paper describes the results of some experiments using a new approach to information access that combines techniques from natural language processing and knowledge representation with a new technique for relevance estimation and passage retrieval. Unlike many attempts to combine natural language processing with information retrieval, these results show significant ...

14
May 1999 SIAM Journal on Applied Mathematics: Volume 59 Issue 5, May-Aug. 1999
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0

Keywords: transmission problem, boundary integral equations, chiral media

15
November 1995
Bibliometrics:
Citation Count: 0

We consider regular finite difference discretizations of systems of elliptic partial differential equations. Regularity of the partial differential system and of the finite difference approximation is assumed. Uniqueness of the finite difference solution is proved in the case that the differential system has a unique solution. In the case of ...

16
August 1995 SIAM Journal on Applied Mathematics: Volume 55 Issue 4, Aug. 1995
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 3

Keywords: transmission problem, boundary integral equations, fluid-solid interaction

17
December 1994 Journal of Electronic Materials: Volume 23 Issue 12, Dec. 1994
Publisher: The Metals, Minerals, and Materials Society
Bibliometrics:
Citation Count: 0

Keywords: high electron mobility transistor, photoluminescence, InGaAs

18

19
April 1988 SIAM Journal on Applied Mathematics: Volume 48 Issue 2, April 1988
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 8




The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us