Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 179851
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T14:28:50+00:00 2026-05-11T14:28:50+00:00

I have a graph-traversal problem that is beautifully and elegantly modeled in smalltalk, but

  • 0

I have a graph-traversal problem that is beautifully and elegantly modeled in smalltalk, but it’s too big (in terms of computation and storage) for one smalltalk image instance. So, I want to partition the problem across multiple instances.

My question is, is there any good way to send messages between smalltalk instances. Kind of like MPI, but for smalltalk.

I should mention that I’m on Squeak, but if there is some flavor of smalltalk with this feature, I can cope.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. 2026-05-11T14:28:50+00:00Added an answer on May 11, 2026 at 2:28 pm

    There is a project named Hydra underway, with a goal to make a Squeak multi-core capable. One of the main features of Hydra are also the inter-image communication channels.

    Some more information:

    • Qwaq releases Hydra multi-core Squeak VM
    • HydraVM devnotes
    • [squeak-dev] [ANN] Hydra now can do mitosis
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a graph library that I use to plot some data. This data
Here's my situation. I have a graph that has different sets of data being
Abstract problem : I have a graph of about 250,000 nodes and the average
]i have this graph that shows the last 7 records from my sqlite database,
I have implemented a graph traversal algorithm which finds a path between two nodes
I have a Graph being drawn inside a UIScrollView . It's one large UIView
I have a graph with n nodes as an adjacency matrix . Is it
I have a graph which contains an unknown number of disconnected subgraphs. What's a
I have oriented graph. Graph can be strongly connected. Every vertex can have a
I have a graph created with MS Chart like the following picture. As you

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.