default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDConstantine D. Polychronopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2012
[c80]Victor K. Y. Wu, Constantine D. Polychronopoulos:
Efficient real-time similarity detection for video caching and streaming. ICIP 2012: 2249-2252- 2010
- [c79]Arun Kejariwal, Milind Girkar, Xinmin Tian, Hideki Saito, Alexandru Nicolau, Alexander V. Veidenbaum, Utpal Banerjee, Constantine D. Polychronopoulos:
Exploitation of nested thread-level speculative parallelism on multi-core systems. Conf. Computing Frontiers 2010: 99-100 - [c78]Arun Kejariwal, Milind Girkar, Xinmin Tian, Hideki Saito, Alexandru Nicolau, Alexander V. Veidenbaum, Utpal Banerjee, Constantine D. Polychronopoulos:
On the efficacy of call graph-level thread-level speculation. WOSP/SIPEW 2010: 247-248
2000 – 2009
- 2009
- [c77]Arun Kejariwal, Alexandru Nicolau, Alexander V. Veidenbaum, Utpal Banerjee, Constantine D. Polychronopoulos:
Efficient Scheduling of Nested Parallel Loops on Multi-Core Systems. ICPP 2009: 74-83 - [c76]Arun Kejariwal, Alexandru Nicolau, Utpal Banerjee, Alexander V. Veidenbaum, Constantine D. Polychronopoulos:
Cache-aware partitioning of multi-dimensional iteration spaces. SYSTOR 2009: 15 - 2008
- [c75]Arun Kejariwal, Alexandru Nicolau, Utpal Banerjee, Alexander V. Veidenbaum, Constantine D. Polychronopoulos:
Cache-aware iteration space partitioning. PPoPP 2008: 269-270 - 2007
- [j24]Miguel A. Melnyk, Admela Jukan, Constantine D. Polychronopoulos:
A Cross-Layer Analysis of Session Setup Delay in IP Multimedia Subsystem (IMS) With EV-DO Wireless Transmission. IEEE Trans. Multim. 9(4): 869-881 (2007) - [c74]Arun Kejariwal, Xinmin Tian, Milind Girkar, Wei Li, Sergey Kozhukhov, Utpal Banerjee, Alexandru Nicolau, Alexander V. Veidenbaum, Constantine D. Polychronopoulos:
Tight analysis of the performance potential of thread speculation using spec CPU 2006. PPoPP 2007: 215-225 - 2006
- [c73]Milind Girkar, Arun Kejariwal, Xinmin Tian, Hideki Saito, Alexandru Nicolau, Alexander V. Veidenbaum, Constantine D. Polychronopoulos:
Probablistic Self-Scheduling. Euro-Par 2006: 253-264 - [c72]Arun Kejariwal, Alexandru Nicolau, Constantine D. Polychronopoulos:
History-aware Self-Scheduling. ICPP 2006: 185-192 - [c71]Arun Kejariwal, Xinmin Tian, Wei Li, Milind Girkar, Sergey Kozhukhov, Hideki Saito, Utpal Banerjee, Alexandru Nicolau, Alexander V. Veidenbaum, Constantine D. Polychronopoulos:
On the performance potential of different types of speculative thread-level parallelism: The DL version of this paper includes corrections that were not made available in the printed proceedings. ICS 2006: 24 - [c70]Arun Kejariwal, Hideki Saito, Xinmin Tian, Milind Girkar, Wei Li, Utpal Banerjee, Alexandru Nicolau, Constantine D. Polychronopoulos:
Lightweight lock-free synchronization methods for multithreading. ICS 2006: 361-371 - [c69]Walden Ko, Constantine D. Polychronopoulos:
Automatic Granularity Selection and OpenMP Directive Generation Via Extended Machine Descriptors in the PROMIS Parallelizing Compiler. IWOMP 2006: 207-216 - [c68]Arun Kejariwal, Alexandru Nicolau, Hideki Saito, Xinmin Tian, Milind Girkar, Utpal Banerjee, Constantine D. Polychronopoulos:
A general approach for partitioning N-dimensional parallel nested loops with conditionals. SPAA 2006: 49-58 - 2005
- [j23]Fabian Breg, Constantine D. Polychronopoulos:
Computational network federations: a middleware architecture for network-based computing. IEEE J. Sel. Areas Commun. 23(10): 2041-2048 (2005) - [c67]Fabian Breg, Admela Jukan, Constantine D. Polychronopoulos:
Computational Federation Service: Dynamic Resource Virtualization for Extensible Grid Service Design. ICAS/ICNS 2005: 85 - [c66]Constantine D. Polychronopoulos:
Computational network federations: computing & communications as a utility. ICPS 2005: 344-349 - [c65]Arun Kejariwal, Alexandru Nicolau, Constantine D. Polychronopoulos:
Enhanced Loop Coalescing: A Compiler Technique for Transforming Non-uniform Iteration Spaces. ISHPC 2005: 17-32 - [c64]Arun Kejariwal, Alexandru Nicolau, Constantine D. Polychronopoulos:
An Efficient Approach for Self-scheduling Parallel Loops on Multiprogrammed Parallel Computers. LCPC 2005: 441-449 - [c63]Georgios Dimitriou, Constantine D. Polychronopoulos:
Hardware Support for Multithreaded Execution of Loops with Limited Parallelism. Panhellenic Conference on Informatics 2005: 622-632 - [c62]Arun Kejariwal, Alexandru Nicolau, Utpal Banerjee, Constantine D. Polychronopoulos:
A novel approach for partitioning iteration spaces with variable densities. PPoPP 2005: 120-131 - 2004
- [j22]Steven Carroll, Constantine D. Polychronopoulos:
A Framework for Incremental Extensible Compiler Construction. Int. J. Parallel Program. 32(4): 289-316 (2004) - [c61]Arun Kejariwal, Paolo D'Alberto, Alexandru Nicolau, Constantine D. Polychronopoulos:
A Geometric Approach for Partitioning N-Dimensional Non-rectangular Iteration Spaces. LCPC 2004: 102-116 - [c60]Georgios Dimitriou, Constantine D. Polychronopoulos:
Loop Scheduling for Multithreaded Processors. PARELEC 2004: 361-366 - 2003
- [j21]Fabian Breg, Constantine D. Polychronopoulos:
Java Virtual Machine support for object serialization. Concurr. Comput. Pract. Exp. 15(3-5): 263-275 (2003) - [j20]Dimitrios S. Nikolopoulos
, Constantine D. Polychronopoulos:
Adaptive scheduling under memory constraints on non-dedicated computationalfarms. Future Gener. Comput. Syst. 19(4): 505-519 (2003) - [c59]Steven Carroll, Constantine D. Polychronopoulos:
A framework for incremental extensible compiler construction. ICS 2003: 53-62 - 2002
- [j19]Dimitrios S. Nikolopoulos, Eduard Ayguadé, Constantine D. Polychronopoulos:
Runtime vs. Manual Data Distribution for Architecture-Agnostic Shared-Memory Programming Models. Int. J. Parallel Program. 30(4): 225-255 (2002) - [j18]Dimitrios S. Nikolopoulos, Constantine D. Polychronopoulos, Theodore S. Papatheodorou, Jesús Labarta, Eduard Ayguadé:
Scheduler-Activated Dynamic Page Migration for Multiprogrammed DSM Multiprocessors. J. Parallel Distributed Comput. 62(6): 1069-1103 (2002) - [c58]Dimitrios S. Nikolopoulos, Constantine D. Polychronopoulos:
Adaptive Scheduling under Memory Pressure on Multiprogrammed Cluster. CCGRID 2002: 22-29 - [c57]Walden Ko, Mark N. Yankelevsky, Dimitrios S. Nikolopoulos, Constantine D. Polychronopoulos:
Effective Cross-Platform, Multilevel Parallelism via Dynamic Adaptive Execution. IPDPS 2002 - [c56]Dimitrios S. Nikolopoulos, Constantine D. Polychronopoulos:
Adaptive Scheduling under Memory Pressure on Multiprogrammed SMPs. IPDPS 2002 - [c55]William H. Sanders, Constantine D. Polychronopoulos, Thomas S. Huang, Tod Courtney, David Daly, Daniel D. Deavours, Salem Derisavi:
Overview: An Integrated Framework for Performance Engineering and Resource-Aware Compilation. IPDPS 2002 - 2001
- [c54]David Craig, Steven Carroll, Fabian Breg, Dimitrios S. Nikolopoulos, Constantine D. Polychronopoulos:
Improving Java Server Performance with Interruptlets. International Conference on Computational Science (1) 2001: 223-232 - [c53]Dimitrios S. Nikolopoulos, Eduard Ayguadé, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesús Labarta:
The trade-off between implicit and explicit data distribution in shared-memory programming paradigms. ICS 2001: 23-37 - [c52]Mark N. Yankelevsky, Constantine D. Polychronopoulos:
alpha-coral: a multigrain, multithreaded processor architecture. ICS 2001: 358-367 - [c51]David Craig, Hwangnam Kim, Raghupathy Sivakumar, Vaduvur Bharghavan, Constantine D. Polychronopoulos:
NanoProtean: Scalable System Software for a Gigabit Active Router. INFOCOM 2001: 51-59 - [c50]Fabian Breg, Constantine D. Polychronopoulos:
Java virtual machine support for object serialization. Java Grande 2001: 173-180 - [c49]Steven Carroll, Walden Ko, Mark N. Yankelevsky, Constantine D. Polychronopoulos:
Optimizing Compiler Design for Modularity and Extensibility. LCPC 2001: 1-17 - [c48]Dimitrios S. Nikolopoulos, Constantine D. Polychronopoulos, Eduard Ayguadé:
Scaling irregular parallel codes with minimal programming effort. SC 2001: 16 - 2000
- [j17]Hideki Saito, Nicholas Stavrakos, Constantine D. Polychronopoulos, Alexandru Nicolau:
The Design of the PROMIS Compiler-Towards Multi-Level Parallelization. Int. J. Parallel Program. 28(2): 195-212 (2000) - [j16]Nikolaos Bellas, Ibrahim N. Hajj, Constantine D. Polychronopoulos, George I. Stamoulis:
Architectural and compiler techniques for energy reduction in high-performance microprocessors. IEEE Trans. Very Large Scale Integr. Syst. 8(3): 317-326 (2000) - [j15]Nikolaos Bellas, Ibrahim N. Hajj, Constantine D. Polychronopoulos:
Using dynamic cache management techniques to reduce energy in general purpose processors. IEEE Trans. Very Large Scale Integr. Syst. 8(6): 693-708 (2000) - [c47]Dimitrios S. Nikolopoulos, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesús Labarta, Eduard Ayguadé:
User-Level Dynamic Page Migration for Multiprogrammed Shared-Memory Multiprocessors. ICPP 2000: 95-104 - [c46]Dimitrios S. Nikolopoulos, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesús Labarta, Eduard Ayguadé:
A case for use-level dynamic page migration. ICS 2000: 119-130 - [c45]Dimitrios S. Nikolopoulos, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesús Labarta, Eduard Ayguadé:
Leveraging Transparent Data Distribution in OpenMP via User-Level Dynamic Page Migration. ISHPC 2000: 415-427 - [c44]Dimitrios S. Nikolopoulos, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesús Labarta, Eduard Ayguadé:
UPMLIB: A Runtime System for Tuning the Memory Performance of OpenMP Programs on Scalable Shared-Memory Multiprocessors. LCR 2000: 85-99 - [c43]Dimitrios S. Nikolopoulos, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesús Labarta, Eduard Ayguadé:
Is Data Distribution Necessary in OpenMP? SC 2000: 47
1990 – 1999
- 1999
- [j14]Tsuneo Nakanishi, Kazuki Joe, Constantine D. Polychronopoulos, Keijiro Araki, Akira Fukuda:
Estimating minimum parallel execution time of loops with loop-carried dependencies. Syst. Comput. Jpn. 30(10): 57-68 (1999) - [c42]Tsuneo Nakanishi, Kazuki Joe, Constantine D. Polychronopoulos, Akira Fukuda:
The Modulo Interval: A Simple and Practical Representation for Program Analysis. IEEE PACT 1999: 91-96 - [c41]Hideki Saito, Nicholas Stavrakos, Steven Carroll, Constantine D. Polychronopoulos, Alexandru Nicolau:
The Design of the PROMIS Compiler. CC 1999: 214-228 - [c40]Nikolaos Bellas, Ibrahim N. Hajj, Constantine D. Polychronopoulos, George D. Stamoulis:
Energy and Performance Improvements in Microprocessor Design Using a Loop Cache. ICCD 1999: 378-383 - [c39]Nikolaos Bellas, Ibrahim N. Hajj, Constantine D. Polychronopoulos:
An analytical, transistor-level energy model for SRAM-based caches. ISCAS (6) 1999: 198-201 - [c38]Hideki Saito, Nicholas Stavrakos, Constantine D. Polychronopoulos:
Multithreading Runtime Support for Loop and Functional Parallelism. ISHPC 1999: 133-144 - [c37]Nikolaos Bellas, Ibrahim N. Hajj, Constantine D. Polychronopoulos:
Using dynamic cache management techniques to reduce energy in a high-performance processor. ISLPED 1999: 64-69 - [c36]Nicholas Stavrakos, Steven Carroll, Hideki Saito, Constantine D. Polychronopoulos, Alexandru Nicolau:
Symbolic Analysis in the PROMIS Compiler. LCPC 1999: 468-471 - [e6]Theodore S. Papatheodorou, Mateo Valero, Constantine D. Polychronopoulos, Yoichi Muraoka, Jesús Labarta:
Proceedings of the 13th international conference on Supercomputing, ICS 1999, Rhodes, Greece, June 20-25, 1999. ACM 1999, ISBN 1-58113-164-X [contents] - [e5]Constantine D. Polychronopoulos, Kazuki Joe, Akira Fukuda, Shinji Tomita:
High Performance Computing, Second International Symposium, ISHPC'99, Kyoto, Japan, May 26-28, 1999, Proceedings. Lecture Notes in Computer Science 1615, Springer 1999, ISBN 3-540-65969-2 [contents] - 1998
- [c35]Alexander V. Veidenbaum, Pen-Chung Yew, David J. Kuck, Constantine D. Polychronopoulos, David A. Padua, Edward S. Davidson, Kyle A. Gallivan:
Retrospective: The Cedar System. 25 Years ISCA: Retrospectives and Reprints 1998: 89-91 - [c34]Nikolaos Bellas, Ibrahim N. Hajj, George D. Stamoulis, Constantine D. Polychronopoulos:
Architectural and compiler support for energy reduction in the memory hierarchy of high performance microprocessors. ISLPED 1998: 70-75 - 1997
- [c33]Carrie J. Brownhill, Alexandru Nicolau, Steven Novack, Constantine D. Polychronopoulos:
The PROMIS Compiler Prototype. IEEE PACT 1997: 116-125 - [c32]Carrie J. Brownhill, Alexandru Nicolau, Steven Novack, Constantine D. Polychronopoulos:
Achieving Multi-level Parallelization. ISHPC 1997: 183-194 - [c31]Masayuki Kuba, Marie-Christine Brunet, Constantine D. Polychronopoulos:
Practical Parallelization of a Molecular Dynamics Application on Shared and Distributed Memory Machines. PP 1997 - [e4]Constantine D. Polychronopoulos, Kazuki Joe, Keijiro Araki, Makoto Amamiya:
High Performance Computing, International Symposium, ISHPC'97, Fukuoka, Japan, November 4-6, 1997, Proceedings. Lecture Notes in Computer Science 1336, Springer 1997, ISBN 3-540-63766-4 [contents] - 1996
- [j13]Mohammad R. Haghighat, Constantine D. Polychronopoulos:
Symbolic Analysis for Parallelizing Compilers. ACM Trans. Program. Lang. Syst. 18(4): 477-518 (1996) - [c30]Tsuneo Nakanishi, Kazuki Joe, Constantine D. Polychronopoulos, Keijiro Araki, Akira Fukuda:
Estimating Parallel Execution Time of Loops with Loop-Carried Dependencies. ICPP, Vol. 3 1996: 61-69 - [c29]Hideki Saito, Constantine D. Polychronopoulos:
sigma-SSA and Its Construction Through Symbolic Interpretation. LCPC 1996: 585-587 - [c28]Tsuneo Nakanishi, Kazuki Joe, Constantine D. Polychronopoulos, Keijiro Araki, Akira Fukuda:
Estimating Minimum Execution Time of Perfect Loop Nests with Loop-Carried Dependences. LCPC 1996: 597-599 - 1995
- [j12]Milind Girkar, Constantine D. Polychronopoulos:
Extracting Task-Level Parallelism. ACM Trans. Program. Lang. Syst. 17(4): 600-634 (1995) - [c27]José E. Moreira, Dale Schouten, Constantine D. Polychronopoulos:
The Performance Impact of Granularity Control and Functional Parallelism. LCPC 1995: 581-597 - [c26]Masayuki Kuba, Constantine D. Polychronopoulos, Kyle A. Gallivan:
The Synergetic Effect of Compiler, Architecture, and Manual Optimizations on the Performance of CFD On Multiprocessors. SC 1995: 72 - [e3]Constantine D. Polychronopoulos:
Proceedings of the 1995 International Conference on Parallel Processing, Urbana-Champain, Illinois, USA, August 14-18, 1995. Volume II: Software. CRC Press 1995, ISBN 0-8493-2616-8 [contents] - 1994
- [j11]Milind Girkar, Constantine D. Polychronopoulos:
The hierarchical task graph as a universal intermediate representation. Int. J. Parallel Program. 22(5): 519-551 (1994) - [c25]Tsuneo Nakanishi, Kazuki Joe, Akira Fukuda, Keijiro Araki, Hideki Saito, Constantine D. Polychronopoulos:
The Data Partitioning Graph: Extending Data and Control Dependencies for Data Partitioning. LCPC 1994: 170-185 - [c24]José E. Moreira, Constantine D. Polychronopoulos:
Autoscheduling in a Distributed Shared-Memory Environment. LCPC 1994: 455-471 - 1993
- [j10]Constantine D. Polychronopoulos:
Parallel Programming Issues. Int. J. High Speed Comput. 5(3): 413-473 (1993) - [c23]Mohammad R. Haghighat, Constantine D. Polychronopoulos:
Symbolic Analysis: A Basis for Parallelization, Optimization, and Scheduling of Programs. LCPC 1993: 567-585 - [c22]Geoffrey C. Fox, Sanjay Ranka, Michael L. Scott, Allen D. Malony, James C. Browne, Marina C. Chen, Alok N. Choudhary, Thomas E. Cheatham, Janice E. Cuny, Rudolf Eigenmann, Amr F. Fahmy, Ian T. Foster, Dennis Gannon, Tomasz Haupt, Carl Kesselman, Charles Koelbel, Wei Li, Monica S. Lam, Thomas J. LeBlanc, Jim Openshaw, David A. Padua, Constantine D. Polychronopoulos, Joel H. Saltz, Alan Sussman, Gil Weigand, Katherine A. Yelick:
Common runtime support for high-performance parallel languages. SC 1993: 752-757 - 1992
- [j9]Milind Girkar, Constantine D. Polychronopoulos:
Automatic Extraction of Functional Parallelism from Ordinary Programs. IEEE Trans. Parallel Distributed Syst. 3(2): 166-178 (1992) - [c21]Mohammad R. Haghighat, Constantine D. Polychronopoulos:
Symbolic Program Analysis and Optimization for Parallelizing Compilers. LCPC 1992: 538-562 - [c20]Carl J. Beckmann, Constantine D. Polychronopoulos:
Microarchitecture support for dynamic scheduling of acyclic task graphs. MICRO 1992: 140-148 - [e2]Ken Kennedy, Constantine D. Polychronopoulos:
Proceedings of the 6th international conference on Supercomputing, ICS 1992, Washington, DC, USA, July 19-24, 1992. ACM 1992, ISBN 0-89791-485-6 [contents] - 1991
- [j8]John B. Andrews, Constantine D. Polychronopoulos:
An Analytical Approach to Performance/Cost Modeling of Parallel Computers. J. Parallel Distributed Comput. 12(4): 343-356 (1991) - [c19]Carl J. Beckmann, Constantine D. Polychronopoulos:
Broadcast Networks for Fast Synchronization. ICPP (1) 1991: 220-224 - [c18]Constantine D. Polychronopoulos:
The hierarchical task graph and its use in auto-scheduling. ICS 1991: 252-263 - [c17]Milind Girkar, Constantine D. Polychronopoulos:
Optimization of Data/Control Conditions in Task Graphs. LCPC 1991: 152-168 - [c16]Mario Mango Furnari, Constantine D. Polychronopoulos:
Run-Time Management of Lisp Parallelism and the Hierarchical Task Graph Program Representation. LCPC 1991: 266-282 - 1990
- [c15]Carl J. Beckmann, Constantine D. Polychronopoulos:
Fast barrier synchronization hardware. SC 1990: 180-189
1980 – 1989
- 1989
- [j7]Constantine D. Polychronopoulos, Milind Girkar, Mohammad R. Haghighat, Chia Ling Lee, Bruce Leung, Dale Schouten:
Parafrase-2: an Environment for Parallelizing, Partitioning, Synchronizing, and Scheduling Programs on Multiprocessors. Int. J. High Speed Comput. 1(1): 45-72 (1989) - [j6]Constantine D. Polychronopoulos, David J. Kuck, David A. Padua:
Utilizing Multidimensional Loop Parallelism on Large-Scale Parallel Processor Systems. IEEE Trans. Computers 38(9): 1285-1296 (1989) - [c14]Constantine D. Polychronopoulos, Milind Girkar, Mohammad R. Haghighat, Chia Ling Lee, Bruce Leung, Dale Schouten:
Parafrase-2: An Environment for Parallelizing Partitioning Synchronizing and Scheduling Programs on Multiprocessors. ICPP (2) 1989: 39-48 - [c13]Carl J. Beckmann, Constantine D. Polychronopoulos:
The Effect of Barrier Synchronization and Scheduling Overhead on Parallel Loops. ICPP (2) 1989: 200-204 - [c12]Constantine D. Polychronopoulos:
Multiprocessing versus Multiprogramming. ICPP (2) 1989: 223-230 - [c11]David C. Rudolph, Constantine D. Polychronopoulos:
An efficient message-passing scheduler based on guided self scheduling. ICS 1989: 50-61 - [c10]Srinivas Patil, Prithviraj Banerjee, Constantine D. Polychronopoulos:
Efficient circuit partitioning algorithms for parallel logic simulation. SC 1989: 361-370 - 1988
- [j5]David J. Kuck, Constantine D. Polychronopoulos:
Special Issue on Languages, Compilers and Environments for Parallel Programming. J. Parallel Distributed Comput. 5(5): 457-459 (1988) - [j4]Constantine D. Polychronopoulos:
Compiler Optimizations for Enhancing Parallelism and Their Impact on Architecture Design. IEEE Trans. Computers 37(8): 991-1004 (1988) - [j3]Constantine D. Polychronopoulos:
Toward auto-scheduling compilers. J. Supercomput. 2(3): 297-330 (1988) - [c9]Constantine D. Polychronopoulos:
The Impact of Run-Time Overhead on Usable Parallelism. ICPP (1) 1988: 108-112 - [c8]Milind Girkar, Constantine D. Polychronopoulos:
Partitioning programs for parallel execution. ICS 1988: 216-229 - [c7]M. Gikar, Constantine D. Polychronopoulos:
Compiling issues for supercomputers. SC 1988: 164-173 - [e1]Elias N. Houstis, Theodore S. Papatheodorou, Constantine D. Polychronopoulos:
Supercomputing, 1st International Conference, Athens, Greece, June 8-12, 1987, Proceedings. Lecture Notes in Computer Science 297, Springer 1988, ISBN 3-540-18991-2 [contents] - 1987
- [j2]Constantine D. Polychronopoulos, Utpal Banerjee:
Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds. IEEE Trans. Computers 36(4): 410-420 (1987) - [j1]Constantine D. Polychronopoulos, David J. Kuck:
Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers. IEEE Trans. Computers 36(12): 1425-1439 (1987) - [c6]Constantine D. Polychronopoulos:
Automatic Restructuring of Fortran Programs for Parallel Execution. Parallel Computing in Science and Engineering 1987: 107-130 - [c5]Constantine D. Polychronopoulos:
Loop Coalesing: A Compiler Transformation for Parallel Machines. ICPP 1987: 235-242 - [c4]Constantine D. Polychronopoulos:
Advanced Loop Optimizations for Parallel Computers. ICS 1987: 255-277 - [c3]Augustus K. Uht, Constantine D. Polychronopoulos, John F. Kolen:
On the combination of hardware and software concurrency extraction methods. MICRO 1987: 133-141 - 1986
- [b1]Constantine D. Polychronopoulos:
On Program Restructuring, Scheduling, and Communication for Parallel Processor Systems. University of Illinois Urbana-Champaign, USA, 1986 - [c2]Constantine D. Polychronopoulos, David J. Kuck, David A. Padua:
Execution of Parallel Loops on Parallel Processor Systems. ICPP 1986: 519-527 - [c1]Constantine D. Polychronopoulos, Utpal Banerjee:
Speedup Bounds and Processor Allocation for Parallel Programs on Multiprocessors. ICPP 1986: 961-968
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
