Name
Affiliation
Papers
ARNOLD L. ROSENBERG
Department of Computer Science Duke University 27706 Durham NC UK
160
Collaborators
Citations 
PageRank 
114
2107
640.21
Referers 
Referees 
References 
2552
1156
1289
Search Limit
1001000
Title
Citations
PageRank
Year
50 Years of TOCS.00.342017
Scheduling Matters: Area-Oriented Heuristic for Resource Management00.342016
On constructing DAG‐schedules with large areas30.382015
An AREA-Oriented Heuristic for Scheduling DAGs on Volatile Computing Platforms80.502015
Region Management by Finite-State Robots.00.342014
On Constructing DAG-Schedules with Large AREAs.30.392014
On Scheduling Series-Parallel Dags To Maximize Area60.442014
Finite-State Robots in the Land of Rationalia.10.362012
The Parking Problem for Finite-State Robots.10.362012
Assessing the computational benefits of AREA-oriented DAG-scheduling70.462011
On Clustering Dags For Task-Hungry Computing Platforms40.402011
Heterogeneity In Computing: Insights From A Worksharing Scheduling Problem00.342011
Link-heterogeneity vs. node-heterogeneity in clusters30.392010
Path-robust multi-channel wireless networks10.372009
A "Big-Ideas" Computation Theory Course for the Undergraduate.00.342008
On Clustering Tasks in IC-Optimal Dags30.402008
Extending IC-Scheduling via the Sweep Algorithm100.522008
On “Exploiting” Node-Heterogeneous Clusters Optimally80.482008
Toward a theory for scheduling dags in Internet-based computing371.422006
Theoretical Computer Science: essays in Memory of Shimon Even140.942006
A pebble game for internet-based computing40.412006
Guidelines for scheduling some common computation-dags for Internet-based computing281.302005
The changing challenges of collaborative algorithmics10.352005
Batch-Scheduling dags for internet-based computing80.532005
On the cost-ineffectiveness of redundancy in commercial P2P computing210.862005
An Algorithmic Model For Heterogeneous Hyper-Clusters: Rationale And Experience170.732005
On Scheduling Computation-Dags For Internet-Based Computing00.342005
Obituary: Shimon Even00.342004
Application Placement On A Cluster Of Servers141.082004
Comparing the Structure of Power-Law Graphs and the Internet AS Graph181.582004
On Scheduling Mesh-Structured Computations for Internet-Based Computing411.782004
To BSP or not to BSP in Heterogeneous NOWs10.362003
Using the compiler to improve cache replacement decisions606.522002
HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors161.062001
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output122.292000
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments30.431999
Augmented Ring Networks70.621999
Using Emulations to Enhance the Performance of Parallel Architectures10.351999
An empirical study of dynamic scheduling on rings of processors.30.471999
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations I: On Maximizing Expected Output20.411999
Scheduling time-constrained communication in linear networks361.941998
A Tight Layout of the Butterfly Network170.961998
Theoretical research on networks: models and methodology10.351997
The reconfigurable ring of processors: fine-grained tree-structured computations.20.461997
Work-preserving emulations of fixed-connection networks678.761997
On trading task reallocation for thread management in partitionable multiprocessors00.341996
Toward efficient scheduling of evolving computations on rings of processors40.521996
Thoughts on parallelism and concurrency in compiling curricula40.691995
A Cost-Effective Streamlining of the Diogenes Design Methodology00.341995
Salvage-Embeddings of Complete Trees10.361995
  • 1
  • 2