Document Type

Report

Date

9-1992

Embargo Period

5-7-2012

Keywords

Loosely synchronous communication, node contention, non-uniform message size, personalized communications, runtime scheduling, static scheduling

Language

English

Disciplines

Computer Sciences

Description/Abstract

In this paper we present several algorithms for all-too-many personalized communications which avoid node contention.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-92-20

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.