SIGN IN
SIGN UP
Maximum weighted matching using the partitioned global address space model
Full Text:
PDF
Buy this Article
Authors:
Alicia Thorsen
Michigan Technological University
Phillip Merkey
Michigan Technological University
Fredrik Manne
University of Bergen, Norway
Published in:
· Proceeding
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Article No. 109
Society for Computer Simulation International
San Diego, CA
, USA
©2009
table of contents
2009 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 10
· Downloads (cumulative): 53
· Citation Count: 0
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
design
global optimization
maximum weighted matching
parallel algorithms
parallelism and concurrency
partitioned global address space
pgas
theory
unified parallel c
upc
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder