default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnold L. Rosenberg
Person information
- affiliation: University of Massachusetts Amherst, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[b3]Arnold L. Rosenberg, Denis Trystram:
Understand Mathematics, Understand Computing - Discrete Mathematics That All Computing Students Should Know. Springer 2020, ISBN 978-3-030-58375-0, pp. 1-550- [c99]Henry A. Gabb, Andrew Lumsdaine, Margaret Martonosi, Arnold L. Rosenberg, Martina Barnas:
EduPar-20 Invited Panel. IPDPS Workshops 2020: 251
2010 – 2019
- 2018
- [j121]Arnold L. Rosenberg:
Bio-Inspired Pattern Processing by Cellular ANTomata. J. Cell. Autom. 13(1-2): 53-80 (2018) - [p2]Sushil K. Prasad, Anshul Gupta, Arnold L. Rosenberg, Alan Sussman, Charles C. Weems:
Editors' Introduction and Roadmap. Topics in Parallel and Distributed Computing 2018: 1-20 - [e8]Sushil K. Prasad, Anshul Gupta, Arnold L. Rosenberg, Alan Sussman, Charles C. Weems:
Topics in Parallel and Distributed Computing, Enhancing the Undergraduate Curriculum: Performance, Concurrency, and Programming on Modern Platforms. Springer 2018, ISBN 978-3-319-93108-1 [contents] - 2017
- [j120]Michela Taufer
, Arnold L. Rosenberg:
Scheduling DAG-based workflows on single cloud instances: High-performance and cost effectiveness with a static scheduler. Int. J. High Perform. Comput. Appl. 31(1): 19-31 (2017) - [j119]Arnold L. Rosenberg:
Nano-Technology and the Nanny State. Int. J. Unconv. Comput. 13(3): 235-244 (2017) - [j118]Alan L. Selman, Arnold L. Rosenberg:
50 Years of TOCS. Theory Comput. Syst. 60(1): 1-2 (2017) - [c98]Arnold L. Rosenberg:
Cellular ANTomata: A Tool for Early PDC Education. Euro-Par Workshops 2017: 252-265 - 2016
- [c97]Arnold L. Rosenberg:
Scheduling DAGs Opportunistically: The Dream and the Reality Circa 2016. Euro-Par 2016: 22-33 - [c96]Arnold L. Rosenberg:
Cellular ANTomata as Engines for Highly Parallel Pattern Processing. ICA3PP Workshops 2016: 261-277 - [c95]Jeremy Benson, Trilce Estrada, Arnold L. Rosenberg, Michela Taufer:
Scheduling Matters: Area-Oriented Heuristic for Resource Management. SBAC-PAD 2016: 214-221 - 2015
- [j117]Scott T. Roche, Arnold L. Rosenberg, Rajmohan Rajaraman:
On constructing DAG-schedules with large areas. Concurr. Comput. Pract. Exp. 27(16): 4107-4121 (2015) - [j116]Gennaro Cordasco, Rosario De Chiara, Arnold L. Rosenberg:
An AREA-Oriented Heuristic for Scheduling DAGs on Volatile Computing Platforms. IEEE Trans. Parallel Distributed Syst. 26(8): 2164-2177 (2015) - 2014
- [j115]Arnold L. Rosenberg:
Region Management by Finite-State Robots. Comput. J. 57(1): 59-72 (2014) - [j114]Gennaro Cordasco, Arnold L. Rosenberg:
On Scheduling Series-Parallel DAGs to Maximize Area. Int. J. Found. Comput. Sci. 25(5): 597-622 (2014) - [c94]Scott T. Roche, Arnold L. Rosenberg, Rajmohan Rajaraman:
On Constructing DAG-Schedules with Large AREAs. Euro-Par 2014: 620-631 - [c93]Sushil K. Prasad, Almadena Yu. Chtchelkanova, Anshul Gupta, Arnold L. Rosenberg, Alan Sussman:
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates (abstract only). SIGCSE 2014: 735 - 2013
- [j113]Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien:
Static Strategies for Worksharing with Unrecoverable Interruptions. Theory Comput. Syst. 53(3): 386-423 (2013) - [c92]Arnold L. Rosenberg:
Finite-State Robots in a Warehouse: Achieving Linear Parallel Speedup While Rearranging Objects. ICPP 2013: 379-388 - 2012
- [j112]Arnold L. Rosenberg:
Cellular ANTomata. Adv. Complex Syst. 15(6) (2012) - [j111]Arnold L. Rosenberg:
The Parking Problem for Finite-State Robots. J. Graph Algorithms Appl. 16(2): 483-506 (2012) - [j110]Gennaro Cordasco, Rosario De Chiara, Arnold L. Rosenberg:
On scheduling dag s for volatile computing platforms: Area-maximizing schedules. J. Parallel Distributed Comput. 72(10): 1347-1360 (2012) - [c91]Arnold L. Rosenberg:
Finite-State Robots in the Land of Rationalia. ISCIS 2012: 3-11 - 2011
- [j109]Gennaro Cordasco, Arnold L. Rosenberg, Mark Sims:
On clustering DAGs for task-hungry computing platforms. Central Eur. J. Comput. Sci. 1(1): 19-35 (2011) - [j108]Arnold L. Rosenberg, Ron Chi-Lung Chiang:
Heterogeneity in Computing: Insights from a Worksharing Scheduling Problem. Int. J. Found. Comput. Sci. 22(6): 1471-1493 (2011) - [j107]Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien:
Static worksharing strategies for heterogeneous computers with unrecoverable interruptions. Parallel Comput. 37(8): 365-378 (2011) - [c90]Arnold L. Rosenberg:
Greedy "Exploitation" Is Close to Optimal on Node-Heterogeneous Clusters. Euro-Par (1) 2011: 155-166 - [c89]Gennaro Cordasco, Rosario De Chiara, Arnold L. Rosenberg:
Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling. Euro-Par (1) 2011: 180-192 - [c88]Kunal Agarwal, Panagiota Fatourou, Arnold L. Rosenberg, Frédéric Vivien:
Introduction. Euro-Par (2) 2011: 224-225 - [c87]Sushil K. Prasad, Almadena Yu. Chtchelkanova, Sajal K. Das, Frank Dehne, Mohamed G. Gouda, Anshul Gupta, Joseph F. JáJá, Krishna Kant, Anita La Salle, Richard LeBlanc, Manish Lumsdaine, David A. Padua, Manish Parashar, Viktor K. Prasanna, Yves Robert, Arnold L. Rosenberg, Sartaj Sahni, Behrooz A. Shirazi, Alan Sussman, Charles C. Weems, Jie Wu:
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates. SIGCSE 2011: 617-618 - 2010
- [b2]Arnold L. Rosenberg:
The Pillars of Computation Theory - State, Encoding, Nondeterminism. Springer 2010, ISBN 978-0-387-09638-4, pp. I-XVII, 1-324 - [j106]Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg:
Extending IC-scheduling via the Sweep Algorithm. J. Parallel Distributed Comput. 70(3): 201-211 (2010) - [c86]Gennaro Cordasco, Arnold L. Rosenberg:
Area-Maximizing Schedules for Series-Parallel DAGs. Euro-Par (2) 2010: 380-392 - [c85]Arnold L. Rosenberg:
Ants in Parking Lots. Euro-Par (2) 2010: 400-411 - [c84]Olivier Beaumont, Arnold L. Rosenberg:
Link-heterogeneity vs. node-heterogeneity in clusters. HiPC 2010: 1-8 - [c83]Ron Chi-Lung Chiang, Anthony A. Maciejewski, Arnold L. Rosenberg, Howard Jay Siegel:
Statistical predictors of computing power in heterogeneous clusters. IPDPS Workshops 2010: 1-9 - [c82]Arnold L. Rosenberg, Ron Chi-Lung Chiang:
Toward understanding heterogeneity in computing. IPDPS 2010: 1-10
2000 – 2009
- 2009
- [c81]Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien:
Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures. Euro-Par Workshops 2009: 71-80 - [c80]Anne Benoit, Yves Robert, Arnold L. Rosenberg, Frédéric Vivien:
Static strategies forworksharing with unrecoverable interruptions. IPDPS 2009: 1-12 - [c79]Gennaro Cordasco, Arnold L. Rosenberg:
On scheduling dags to maximize area. IPDPS 2009: 1-12 - [c78]Arnold L. Rosenberg:
Path-robust multi-channel wireless networks. IPDPS 2009: 1-10 - 2008
- [j105]Arnold L. Rosenberg:
A "Big-Ideas" Computation Theory Course for the Undergraduate. Bull. EATCS 94: 222-232 (2008) - [j104]Micah Adler, Ying Gong, Arnold L. Rosenberg:
On "Exploiting" Node-Heterogeneous Clusters Optimally. Theory Comput. Syst. 42(4): 465-487 (2008) - [c77]Mark Sims, Gennaro Cordasco, Arnold L. Rosenberg:
On Clustering Tasks in IC-Optimal Dags. ICPP 2008: 381-388 - [c76]Arnold L. Rosenberg:
Cellular ANTomata: Food-Finding and Maze-Threading. ICPP 2008: 528-535 - [c75]Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg:
Extending IC-Scheduling via the Sweep Algorithm. PDP 2008: 366-373 - 2007
- [j103]Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde:
A Tool for Prioritizing DAGMan Jobs and its Evaluation. J. Grid Comput. 5(2): 197-212 (2007) - [j102]Bhuvan Urgaonkar, Arnold L. Rosenberg, Prashant J. Shenoy:
Application Placement on a Cluster of Servers. Int. J. Found. Comput. Sci. 18(5): 1023-1041 (2007) - [j101]Arnold L. Rosenberg:
Best Paper Award recipients: 2006 International Parallel and Distributed Processing Symposium. J. Parallel Distributed Comput. 67(12): 1231 (2007) - [j100]Gennaro Cordasco, Vittorio Scarano, Arnold L. Rosenberg:
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories. IEEE Trans. Parallel Distributed Syst. 18(7): 973-982 (2007) - [j99]Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg:
Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality. IEEE Trans. Parallel Distributed Syst. 18(11): 1607-1617 (2007) - [c74]Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg:
Applying IC-Scheduling Theory to Familiar Classes of Computations. IPDPS 2007: 1-8 - [c73]Robert Hall, Arnold L. Rosenberg, Arun Venkataramani:
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing. IPDPS 2007: 1-9 - [c72]Arnold L. Rosenberg:
Cellular ANTomata. ISPA 2007: 78-90 - [c71]George Dean Bissias, Brian Neil Levine, Arnold L. Rosenberg:
Bounding damage from link destruction, with application to the internet. SIGMETRICS 2007: 367-368 - 2006
- [j98]Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych:
Toward a Theory for Scheduling Dags in Internet-Based Computing. IEEE Trans. Computers 55(6): 757-768 (2006) - [c70]Grzegorz Malewicz, Arnold L. Rosenberg:
A Pebble Game for Internet-Based Computing. Essays in Memory of Shimon Even 2006: 291-312 - [c69]Arnold L. Rosenberg:
State. Essays in Memory of Shimon Even 2006: 375-398 - [c68]Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde:
A Tool for Prioritizing DAGMan Jobs and Its Evaluation. HPDC 2006: 156-168 - [c67]Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg:
On Scheduling Expansive and Reductive Dags for Internet-Based Computing. ICDCS 2006: 29 - [p1]Arnold L. Rosenberg:
Changing Challenges for Collaborative Algorithmics. Handbook of Nature-Inspired and Innovative Computing 2006: 1-44 - [e7]Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman:
Theoretical Computer Science, Essays in Memory of Shimon Even. Lecture Notes in Computer Science 3895, Springer 2006, ISBN 3-540-32880-7 [contents] - 2005
- [j97]Jacir Luiz Bordim, Koji Nakano, Arnold L. Rosenberg:
Foreword. Int. J. Found. Comput. Sci. 16(1): 1-2 (2005) - [j96]Jacir Luiz Bordim, Koji Nakano, Arnold L. Rosenberg:
Foreword. Int. J. Found. Comput. Sci. 16(2): 143-144 (2005) - [j95]Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg:
An algorithmic model for heterogeneous hyper-clusters: rationale and experience. Int. J. Found. Comput. Sci. 16(2): 195-215 (2005) - [j94]Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg:
Efficient trigger-broadcasting in heterogeneous clusters. J. Parallel Distributed Comput. 65(5): 628-642 (2005) - [j93]Arnold L. Rosenberg, Matthew Yurkewych:
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing. IEEE Trans. Computers 54(4): 428-438 (2005) - [c66]Matthew Yurkewych, Brian Neil Levine, Arnold L. Rosenberg:
On the cost-ineffectiveness of redundancy in commercial P2P computing. CCS 2005: 280-288 - [c65]Grzegorz Malewicz, Arnold L. Rosenberg:
Batch-Scheduling Dags for Internet-Based Computing. Euro-Par 2005: 262-271 - [c64]Arnold L. Rosenberg:
The Changing Challenges of Collaborative Algorithmics. HiPC 2005: 5 - [c63]Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych:
On Scheduling Complex Dags for Internet-Based Computing. IPDPS 2005 - 2004
- [j92]Arnold L. Rosenberg:
Obituary: Shimon Even. Theory Comput. Syst. 37(4): 481 (2004) - [j91]Arnold L. Rosenberg:
On Scheduling Mesh-Structured Computations for Internet-Based Computing. IEEE Trans. Computers 53(9): 1176-1186 (2004) - [c62]Arnold L. Rosenberg, Matthew Yurkewych:
On Scheduling Computation-Dags for Internet-Based Computing. PDCS 2004: 58-63 - [c61]Bhuvan Urgaonkar, Arnold L. Rosenberg, Prashant J. Shenoy:
Application Placement on a Cluster of Servers. PDCS 2004: 85-90 - [c60]Arnold L. Rosenberg:
How to Share a Bag of Tasks Optimally in a Heterogeneous Cluster - Three Models, Three Answers. Annual Simulation Symposium 2004: 3 - [c59]Sharad Jaiswal, Arnold L. Rosenberg, Donald F. Towsley:
Comparing the Structure of Power-Law Graphs and the Internet AS Graph. ICNP 2004: 294-303 - [c58]Arnold L. Rosenberg:
An Algorithmic Model for Heterogeneous Clusters: Rationale and Experience. IPDPS 2004 - 2003
- [j90]Arnold L. Rosenberg:
Efficient Pairing Functions - and Why You Should Care. Int. J. Found. Comput. Sci. 14(1): 3-17 (2003) - [j89]Arnold L. Rosenberg:
Accountable Web-Computing. IEEE Trans. Parallel Distributed Syst. 14(2): 97-106 (2003) - [c57]Micah Adler, Ying Gong, Arnold L. Rosenberg:
Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?". Annual Simulation Symposium 2003: 39-46 - [c56]Gennaro Cordasco, Alberto Negro, Vittorio Scarano, Arnold L. Rosenberg:
c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories. Euro-Par 2003: 911-916 - [c55]Michael K. Bradshaw, Arnold L. Rosenberg, Donald F. Towsley:
Planned Object Duplication Strategies in Dynamic PRR Meshes. ICNP 2003: 50-60 - [c54]Arnold L. Rosenberg:
On Scheduling Collaborative Computations on the Internet, I: Mesh-Dags and Their Close Relatives. IPDPS 2003: 6 - [c53]Arnold L. Rosenberg:
To BSP or not to BSP in Heterogeneous NOWs. IPDPS 2003: 165 - [c52]Micah Adler, Ying Gong, Arnold L. Rosenberg:
Optimal sharing of bags of tasks in heterogeneous clusters. SPAA 2003: 1-10 - [e6]Arnold L. Rosenberg, Friedhelm Meyer auf der Heide:
SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003). ACM 2003, ISBN 1-58113-661-7 [contents] - 2002
- [j88]Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, Walter Unger:
Scheduling Time-Constrained Communication in Linear Networks. Theory Comput. Syst. 35(6): 599-623 (2002) - [j87]Arnold L. Rosenberg:
Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload. IEEE Trans. Parallel Distributed Syst. 13(2): 179-191 (2002) - [c51]Zhenlin Wang, Kathryn S. McKinley, Arnold L. Rosenberg, Charles C. Weems:
Using the Compiler to Improve Cache Replacement Decisions. IEEE PACT 2002: 199-208 - [c50]Arnold L. Rosenberg:
Accountable Web-Computing. IPDPS 2002 - [c49]Arnold L. Rosenberg:
Efficient Pairing Functions - And Why You Should Care. IPDPS 2002 - [e5]Arnold L. Rosenberg, Bruce M. Maggs:
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002. ACM 2002, ISBN 1-58113-529-7 [contents] - 2001
- [b1]Arnold L. Rosenberg, Lenwood S. Heath:
Graph separators with applications. Frontiers of computer science, Kluwer 2001, ISBN 978-0-306-46464-5, pp. I-XII, 1-257 - [j86]William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman:
Augmented Ring Networks. IEEE Trans. Parallel Distributed Syst. 12(6): 598-609 (2001) - [c48]Arnold L. Rosenberg:
Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better. CLUSTER 2001: 124- - [c47]Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg:
HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors. IPDPS 2001: 42 - [c46]Dawn J. Lawrie, W. Bruce Croft, Arnold L. Rosenberg:
Finding Topic Words for Hierarchical Summarization. SIGIR 2001: 349-357 - [e4]Arnold L. Rosenberg:
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001. ACM 2001, ISBN 1-58113-409-6 [contents] - 2000
- [j85]Arnold L. Rosenberg:
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guaranteed Output. Int. J. Found. Comput. Sci. 11(1): 183-204 (2000) - [j84]Arnold L. Rosenberg:
Editorial Message. Theory Comput. Syst. 33(5/6): 333 (2000) - [c45]Arnold L. Rosenberg:
Optimal Sharing of Partitionable Workloads in Heterogeneous Networks of Workstations. PDPTA 2000 - [c44]Arnold L. Rosenberg:
Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract). SPAA 2000: 22-29
1990 – 1999
- 1999
- [j83]Arnold L. Rosenberg:
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations I: On Maximizing Expected Output. J. Parallel Distributed Comput. 59(1): 31-53 (1999) - [j82]M. E. Barrows, Dawn E. Gregory, Lixin Gao, Arnold L. Rosenberg, Paul R. Cohen:
An empirical study of dynamic scheduling on rings of processors. Parallel Comput. 25(9): 1063-1079 (1999) - [j81]Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman:
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments. IEEE Trans. Parallel Distributed Syst. 10(8): 813-824 (1999) - [j80]Bojana Obrenic, Martin C. Herbordt, Arnold L. Rosenberg, Charles C. Weems:
Using Emulations to Enhance the Performance of Parallel Architectures. IEEE Trans. Parallel Distributed Syst. 10(10): 1067-1081 (1999) - [c43]Arnold L. Rosenberg:
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output. IPPS/SPDP 1999: 520-524 - [c42]William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman:
Augmented Ring Networks. SIROCCO 1999: 1-16 - 1998
- [j79]Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg:
A Tight Layout of the Butterfly Network. Theory Comput. Syst. 31(4): 475-488 (1998) - [j78]Shimon Even, Ami Litman, Arnold L. Rosenberg:
Monochromatic Paths and Triangulated Graphs. SIAM J. Discret. Math. 11(4): 546-556 (1998) - [c41]Arnold L. Rosenberg:
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations. IPPS/SPDP 1998: 519-523 - [c40]Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, Walter Unger:
Scheduling Time-Constrained Communication in Linear Networks. SPAA 1998: 269-278 - 1997
- [j77]Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe:
Work-preserving emulations of fixed-connection networks. J. ACM 44(1): 104-147 (1997) - [j76]Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
An Optimal Strategies for Cycle-Stealing in Networks of Workstations. IEEE Trans. Computers 46(5): 545-557 (1997) - [j75]Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman:
The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations. IEEE Trans. Computers 46(10): 1119-1131 (1997) - [c39]Arnold L. Rosenberg:
Theoretical research on networks: models and methodology. SIROCCO 1997: 282-293 - 1996
- [j74]