OpenAlex
PricingAboutJobs
Log inGet started
Work

Satin: Efficient Parallel Divide-and-Conquer in Java

HTML

Year: 2000
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Euro-Par 2000 Parallel Processing: 6th International Euro-Par Conference Munich, Germany, August 29 – September 1, 2000 Proceedings
DOI: 10.1007/3-540-44520-x_96
Authors: Rob V. van Nieuwpoort, Thilo Kielmann, Henri E. Bal
Institution: Vrije Universiteit Amsterdam
Language: English

Topic: Parallel Computing and Optimization Techniques
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Keywords: satin, Java extension, distributed memory systems, work stealing, parallel programming languages

Open Access status: closed
OpenAlex ID: W1682557070
FWCI: 2.124
Cites: 26
Cited by: 50
Related to: 8
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security