Zobrazeno 1 - 10
of 56
pro vyhledávání: '"E. Schenfeld"'
Publikováno v:
IEEE Transactions on Computers. 45:793-801
One limitation on the operating speed of electronic circuits is the rate at which the packaging can dissipate heat. In CMOS technology, the heat generated by a processor is approximately proportional to its clock rate. The paper examines the idea of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9975e8f81f79347d304b97a17f7b598d
https://doi.org/10.1109/12.508318
https://doi.org/10.1109/12.508318
Publikováno v:
Proceedings. Fifth International Conference on Massively Parallel Processing (Cat. No.98EX182).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::418416853249be0ebf7904cf8a071038
https://doi.org/10.1109/mppoi.1998.682140
https://doi.org/10.1109/mppoi.1998.682140
Autor:
E. Schenfeld, S. Wei
Publikováno v:
IPPS
The hierarchical interconnection cache network (HICN) is a novel network architecture for massively parallel processing systems. The HICN's topology is a hierarchy of multiple, three-stage interconnection cache networks. The first and third stages of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ada8d00fadb3fa9e2be9b88870fdbe3
https://doi.org/10.1109/ipps.1993.262870
https://doi.org/10.1109/ipps.1993.262870
Autor:
E. Schenfeld, V. Gupta
Publikováno v:
IPPS
The problem of identifying whether a graph has a bounded l-contraction for a given integer l is known to be NP-complete for l>2. The authors describe a heuristic approach based on simulated annealing to approximate the solution of this problem. Perfo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4dc3cc26d15c37adbbf0cd748f0ade03
https://doi.org/10.1109/ipps.1993.262895
https://doi.org/10.1109/ipps.1993.262895
Autor:
E. Schenfeld, Yuh-Dauh Lyuu
Publikováno v:
SPDP
Scopus-Elsevier
Scopus-Elsevier
Total exchange is the densest parallel communication primitive and poses a severe test for the capability of any parallel architecture. This operation is very important and arises in many applications. We show that a reconfigurable parallel architect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6809ca90a9f86b544c2706642c62cc13
https://doi.org/10.1109/spdp.1993.395558
https://doi.org/10.1109/spdp.1993.395558
Publikováno v:
Proceedings of 16th International Conference on Distributed Computing Systems.
Synchronization is inherent to parallel computing and comprises many aspects. One aspect is the access control to shared data, especially important in MIMD shared-memory architectures. Several locking mechanisms have been proposed to perform this tas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a38e7b930e27feb207505a33f679991f
https://doi.org/10.1109/icdcs.1996.507922
https://doi.org/10.1109/icdcs.1996.507922
Publikováno v:
First International Workshop on Massively Parallel Processing Using Optical Interconnections.
The authors attempt to form a coherent picture that may suggest possible future directions of using the benefits optics has to offer, yet avoiding its drawbacks for optical interconnection networks. Possible questions addressed include: What is the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2267bfad7cfbe9352e7cb8bf84c89903
https://doi.org/10.1109/mppoi.1994.336613
https://doi.org/10.1109/mppoi.1994.336613
Autor:
E. Schenfeld, Vishal Gupta
Publikováno v:
ISPAN
In distributed memory parallel machines, data access times can vary greatly depending on data location. This makes locality considerations important for improving performance. Switching locality is a special kind of locality which conventional networ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::465f4e2b3dc02c65e54dd6f04b5ae9f9
https://doi.org/10.1109/ispan.1994.367153
https://doi.org/10.1109/ispan.1994.367153
Autor:
E. Schenfeld, Amnon Barak
Publikováno v:
SPDP
The authors present a novel method for embedding parallel programs of multiple processes exhibiting classical communication topologies into optical parallel architecture model (OPAM) parallel architecture. OPAM consists of a large number of processor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fca2972e6cb61b74c288a3addf934c29
https://doi.org/10.1109/spdp.1991.218260
https://doi.org/10.1109/spdp.1991.218260
Autor:
N.R. Adiga, G. Almasi, G.S. Almasi, Y. Aridor, R. Barik, D. Beece, R. Bellofatto, G. Bhanot, R. Bickford, M. Blumrich, A.A. Bright, J. Brunheroto, C. Cascaval, J. Castanos, W. Chan, L. Ceze, P. Coteus, S. Chatterjee, D. Chen, G. Chiu, T.M. Cipolla, P. Crumley, K.M. Desai, A. Deutsch, T. Domany, M.B. Dombrowa, W. Donath, M. Eleftheriou, C. Erway, J. Esch, B. Fitch, J. Gagliano, A. Gara, R. Garg, R. Germain, M.E. Giampapa, B. Gopalsamy, J. Gunnels, M. Gupta, F. Gustavson, S. Hall, R.A. Haring, D. Heidel, P. Heidelberger, L.M. Herger, D. Hoenicke, R.D. Jackson, T. Jamal-Eddine, G.V. Kopcsay, E. Krevat, M.P. Kurhekar, A.P. Lanzetta, D. Lieber, L.K. Liu, M. Lu, M. Mendell, A. Misra, Y. Moatti, L. Mok, J.E. Moreira, B.J. Nathanson, M. Newton, M. Ohmacht, A. Oliner, V. Pandit, R.B. Pudota, R. Rand, R. Regan, B. Rubin, A. Ruehli, S. Rus, R.K. Sahoo, A. Sanomiya, E. Schenfeld, M. Sharma, E. Shmueli, S. Singh, P. Song, V. Srinivasan, B.D. Steinmacher-Burow, K. Strauss, C. Surovic, R. Swetz, T. Takken, R.B. Tremaine, M. Tsao, A.R. Umamaheshwaran, P. Verma, P. Vranas, T.J.C. Ward, M. Wazlowski, W. Barrett, C. Engel, B. Drehmel, B. Hilgart, D. Hill, F. Kasemkhani, D. Krolak, C.T. Li, T. Liebsch, J. Marcella, A. Muff, A. Okomo, M. Rouse, A. Schram, M. Tubbs, G. Ulsh, C. Wait, J. Wittrup, M. Bae, K. Dockser, L. Kissel, M.K. Seager, J.S. Vetter, K. Yates
Publikováno v:
ACM/IEEE SC 2002 Conference (SC'02).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f1c2d1cda5719e9be3a6036355372c6
https://doi.org/10.1109/sc.2002.10017
https://doi.org/10.1109/sc.2002.10017