Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Philip Christie

dblp:322/0838 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 50% Electronic design automation · 50%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › layout optimization
wire length minimization
0.011993
A fractal analysis of interconnection complexity · Proc. IEEE 1993
Computational geometry › fractal geometry
fractal dimension
0.011993
A fractal analysis of interconnection complexity · Proc. IEEE 1993

Methods — techniques the papers use, named apart from their topics

simulated annealing · 0.0multifractal analysis · 0.0
YearPublicationVenuePosition
1993 A fractal analysis of interconnection complexity
abstract
The emergent, collective properties of computer interconnections are shown to be characterized by a noninteger dimension D/sub i/, which is, in general, different from the system's Euclidean dimension. This dimension characterizes the properties of a fractal support, or substrate, on which interconnections are placed to provide communication throughout the system. The interconnection support also acts as a host for a multifractal spectrum of interconnection distribution processes which characterize the change in connectivity in moving from the backplane to the transistor level. The properties of fractal systems are investigated by attempting to minimize their total wire length using a simulated annealing algorithm. Systems whose interconnection dimension is approximately equal to their Euclidean dimension are shown to possess minimum wire length arrangements. These results are then interpreted in terms of a geometrical temperature T/sub i/=1/D/sub i/. This analysis indicates that the system passes through a phase transition at T/sub i/ approximately=1/2 and that attainable system temperatures are bounded by 1/3>
Philip Christie
Proc. IEEE1