Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures (2009)
Benoit, Anne, Robert, Yves, Rosenberg, Arnold, Vivien, Frédéric
One has a large workload that is "divisible" (its constituent work's granularity can be adjusted arbitrarily) and one has access to p remote computers that can assist in computing the workload. How...
Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures (2009)
Benoit, Anne, Robert, Yves, Rosenberg, Arnold, Vivien, Frédéric
One has a large workload that is "divisible" (its constituent work's granularity can be adjusted arbitrarily) and one has access to p remote computers that can assist in computing the workload. How...
Static Strategies for Worksharing with Unrecoverable Interruptions (Extended version) (2009)
Benoit, Anne, Robert, Yves, Rosenberg, Arnold, Vivien, Frédéric
One has a large workload that is ``divisible''---its constituent work's granularity can be adjusted arbitrarily---and one has access to p remote computers that can assist in computing the workload....
Static Strategies for Worksharing with Unrecoverable Interruptions (Extended version) (2009)
Benoit, Anne, Robert, Yves, Rosenberg, Arnold, Vivien, Frédéric
One has a large workload that is ``divisible''---its constituent work's granularity can be adjusted arbitrarily---and one has access to p remote computers that can assist in computing the workload....
Static Strategies for Worksharing with Unrecoverable Interruptions (Extended version) (2009)
Benoit, Anne, Robert, Yves, Rosenberg, Arnold, Vivien, Frédéric
One has a large workload that is "divisible''---its constituent work's granularity can be adjusted arbitrarily---and one has access to $p$ remote computers that can assist in computing the workload....
Static Strategies for Worksharing with Unrecoverable Interruptions (Extended version) (2009)
Benoit, Anne, Robert, Yves, Rosenberg, Arnold, Vivien, Frédéric
One has a large workload that is "divisible''---its constituent work's granularity can be adjusted arbitrarily---and one has access to $p$ remote computers that can assist in computing the workload....
Finding Topic Words for Hierarchical Summarization ABSTRACT (2008)
Dawn Lawrie, W. Bruce Croft, Arnold Rosenberg
Hierarchies have long been used for organization, summarization, and access to information. In this paper we define summarization in terms of a probabilistic language model and use the definition to...
Application Placement on a Cluster of Servers (Extended Abstract) (2008)
Bhuvan Urgaonkar, Arnold Rosenberg, Prashant Shenoy
this paper we study properties of the application placement problem (APP) whose goal is to maximize the number of applications that can be hosted on a platform. We show that APP is NP-hard and...
Optimal Simulations of Tree Machines, (2002)
Bhatt,Sandeep, Chung,Fan, Leighton,Tom, Rosenberg,Arnold
Universal networks offer the advantage that they can execute programs written for simpler architectures without significant run-time overhead this reprint investigates simulations of tree machines;...
Optimal Simulations by Butterfly Networks: Extended Abstract, (1998)
Bhatt, Sandeep N., Chung, Fan R., Hong, Jia-Wei, Leighton, F. T., Rosenberg, Arnold
We investigate the power of the Butterfly network (which is the FFT network with inputs and outputs identified) relative to other proposed multicomputer interconnection networks, by considering how...
Work-Preserving Emulations of Fixed-Connection Networks, (1998)
Koch, Richard, Leighton, Tom, Maggs, Bruce, Rao, Satish, Rosenberg, Arnold
In this paper, we study the problem of emulating TG steps of an NG-node guest network on an NH-node host network. Although many isolated emulation results have been proved for specific networks in...
Work-Preserving Emulations of Fixed-Connection Networks, (1998)
Koch, Richard, Leighton, Tom, Maggs, Bruce, Rao, Satish, Rosenberg, Arnold
In this paper the problem of emulating TG steps of an NG-node guest network on an NH-node host network. We call an emulation work-preserving if the time required by the host, TH, is O(TGNG/NH)...
The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations (1997)
Arnold Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman
We study fine-grain computation on the Reconfigurable Ring of Processors (RRP), a parallel architecture whose processing elements (PEs) are interconnected via a multiline reconfigurable bus, each of...
Thoughts on Parallelism and Concurrency in Computing Curricula (1995)
this paper were developed after conversations with several UMass colleagues: Kathryn McKinley, Eliot Moss, Jack Stankovic, Don Towsley, and especially Chip Weems. Their wisdom is intermingled with my...