<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-19T22:51:51Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81086" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81086</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_8888</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_8887</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Wong, Martin D.F.</dc:contributor>
          <dc:creator>Zhong, Yu</dc:creator>
          <dc:date>2015-09-25T20:09:32Z</dc:date>
          <dc:date>2015-09-25T20:09:32Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2008</dc:date>
          <dc:date>2008</dc:date>
          <dc:description>The design of power grid becomes even more difficult due to the bottleneck of simulation. We propose algorithms to determine the placement of power pads that minimize not only the worst voltage drop but also the voltage deviation across the power grid. Our algorithm uses simulated annealing to minimize the total cost of voltage drops. The key enabler for efficient optimization is a fast localized node-based iterative method to compute the voltages after each movement of pads. Experimental results show that our algorithm demonstrates good runtime characteristics for power grids with large numbers of pad candidates in multimillion-size circuits.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:09:32Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3314956.pdf: 1388209 bytes, checksum: 3448d7b3a8b624d12344a822780eac9d (MD5)
  Previous issue date: 2008</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82368
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>94 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81086</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3314956</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Engineering, Electronics and Electrical</dc:subject>
          <dc:title>Fast Algorithms for the Design and Analysis of Large Power Grids</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical and Computer Engineering</department>
            <discipline>Electrical and Computer Engineering</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
