home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!olivea!decwrl!bu.edu!bigbird.bu.edu
- From: hss@bigbird.bu.edu (Himanshu Sinha)
- Newsgroups: comp.sys.isis
- Subject: Array Indexing with addresses
- Message-ID: <91672@bu.edu>
- Date: 22 Jul 92 23:20:12 GMT
- Sender: news@bu.edu
- Distribution: usa
- Organization: Computer Science Department, Boston University, Boston, MA, USA
- Lines: 20
-
- I need to maintain a queue of messages sent by each member of a process group.
- When a process receives a message it enqueus it in the queue for the sender of
- the message. I want a fast way of finding out which queue to enque it in - so a
- associative search in the list of members (using addr_isequal) is not a
- preferred solution. I would rather have an array of queues but I do not know
- what to use to index this array. I think I can use the pg_rank() of the sender
- but I have two questions.
-
- 1) The pg_rank() of a process can change if the group membership changes. I
- assume that a process will receive all abcasts, cbcasts and fbcasts sent by a
- failed process atomically i.e. all members will get them before the groupview
- changes or none of them will get them. Can I make any such assumptions about
- mbcasts()? (I don't think so.)
-
- 2) What is the overhead of pg_rank()? My group will have at most 25 members,
- most of them running on backbone machines. Am I better off doing an associative
- search?
-
- Thanks
- Himanshu
-